31. There are decision problems that are NP-hard but not NP-complete, for example the halting problem. 32. This is proved by reducing a decision problem of quantified Boolean formula to Edge Geography. 33. Every search problem has a corresponding decision problem , namely 34. The decision problem for Presburger arithmetic is an interesting example in computational complexity theory and computation. 35. However, this is not really the case, since function problems can be recast as decision problems . 36. If the manager is given control over these decisions problems can arise ( see below ). 37. Generalizations of Bayesian networks that can represent and solve decision problems under uncertainty are called influence diagrams. 38. To highlight the decision problem in as stark a way as possible, the first was quite artificial. 39. By repeatedly answering the decision problem , it is possible to find the minimal weight of a tour. 40. Unlike Peano arithmetic, Skolem arithmetic is a computational complexity of this decision problem is triply exponential, however.
