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

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...

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

back as 1897. The subset sum problem is a special case of the decision and 0-1 problems where each kind of item, the weight equals the value: w i = v...

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"...

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

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

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

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

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...

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 problems in...

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...

precisely, a problem is NP-complete when: It is a decision problem, meaning that for any input to the problem, the output is either "yes" or "no". When the...

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...

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...

semiconductor chip design. Computationally, the problem is NP-hard, and the corresponding decision problem, deciding if items can fit into a specified number...

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

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 (where...

structuring and solving decision and planning problems involving multiple criteria. The purpose is to support decision-makers facing such problems. Typically, there...

probability, statistics, and decision theory. It is also known as the marriage problem, the sultan's dowry problem, the fussy suitor problem, the googol game, and...

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...

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

testing and parameter estimation, are special cases of the general decision problem. Wald's paper renewed and synthesized many concepts of statistical...

formulated as a decision problem. The input to the decision problem is a pair of graphs G {\displaystyle G} and H. The answer to the problem is positive if...

In computability theory, an undecidable problem is a decision problem for which an effective method (algorithm) to derive the correct answer does not...

the more commonly known problems that are NP-complete when expressed as decision problems. As there are thousands of such problems known, this list is in...

efficiency in analyzing decision problems. In that sense, decision quality can be seen as an extension to decision analysis. Decision quality also describes...

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...