decision problem is a computational problem that can be posed as a yes–no question based on the given input values. An example of a decision problem is...

Research about decision-making is also published under the label problem solving, particularly in European psychological research. Decision-making can be...

Markov decision process (MDP), also called a stochastic dynamic program or stochastic control problem, is a model for sequential decision making when outcomes...

mathematics and computer science, the Entscheidungsproblem (German for 'decision problem'; pronounced [ɛntˈʃaɪ̯dʊŋspʁoˌbleːm]) is a challenge posed by David...

a complexity class used to classify decision problems. NP is the set of decision problems for which the problem instances, where the answer is "yes"...

of a decision problem at a certain point in time in terms of the payoff from some initial choices and the "value" of the remaining decision problem that...

A decision tree is a decision support recursive partitioning structure that uses a tree-like model of decisions and their possible consequences, including...

make decisions about problems that may be rapidly changing and not easily specified in advance—i.e., unstructured and semi-structured decision problems. Decision...

knapsack problem has been studied for more than a century, with early works dating as far back as 1897. Knapsack problems appear in real-world decision-making...

Decision problems are one of the central objects of study in computational complexity theory. A decision problem is a type of computational problem where...

theory and computational complexity theory, an undecidable problem is a decision problem for which it is proved to be impossible to construct an algorithm...

model a variety of real-world sequential decision processes. Applications include robot navigation problems, machine maintenance, and planning under uncertainty...

computational complexity theory, a problem is NP-complete when: It is a decision problem, meaning that for any input to the problem, the output is either "yes"...

computational problem, a model of computation, and a bounded resource like time or memory. In particular, most complexity classes consist of decision problems that...

set of the counting problems associated with the decision problems in the set NP. More formally, #P is the class of function problems of the form "compute...

must be formulated as a decision problem. The input to the decision problem is a pair of graphs G and H. The answer to the problem is positive if H is isomorphic...

enlarged), and solving the decision problem of testing whether a graph contains a clique larger than a given size. The clique problem arises in the following...

Unsolved problem in computer science: If the solution to a problem is easy to check for correctness, must the problem be easy to solve? (more unsolved...

solve than all problems in NP, but they are probably not NP-hard (unless P=NP). A decision problem H is NP-hard when for every problem L in NP, there...

could introduce suitable decision problems, the problem is more naturally characterized as an optimization problem. Counting problem (complexity) – Type of...

natural decision and optimization problems, are at most as difficult to solve as SAT. There is no known algorithm that efficiently solves each SAT problem, and...

complex than that of a decision problem. For function problems, the output is not simply 'yes' or 'no'. A functional problem P {\displaystyle P} is defined...

representation. A decision problem is a computational problem where the answer for every instance is either yes or no. An example of a decision problem is primality...

The subset sum problem (SSP) is a decision problem in computer science. In its most general formulation, there is a multiset S {\displaystyle S} of integers...

In computational complexity theory, a decision problem is PSPACE-complete if it can be solved using an amount of memory that is polynomial in the input...

purchaser problem, the vehicle routing problem and the ring star problem are three generalizations of TSP. The decision version of the TSP (where given a length...

introduce suitable decision problems, the problem is then more naturally characterized as an optimization problem. An NP-optimization problem (NPO) is a combinatorial...

c_{R}(x)\}} denotes the corresponding decision problem. Note that cR is a search problem while #R is a decision problem, however cR can be C Cook-reduced...

means no program f will solve the halting problem in every possible case. The halting problem is a decision problem about properties of computer programs...

In computational complexity theory, co-NP is a complexity class. A decision problem X is a member of co-NP if and only if its complement X is in the complexity...