NP-Complete Decision Problems for Quadratic Polynomials
Kenneth L. MandersLeonard M. AdlemanPublished in: STOC (1976)
Keyphrases
- decision problems
- np complete
- computational complexity
- np hard
- pspace complete
- influence diagrams
- decision model
- conp complete
- bounded treewidth
- optimal strategy
- randomly generated
- decision processes
- multiple criteria
- satisfiability problem
- sequential decision making
- special case
- data complexity
- partially observable
- conjunctive queries
- optimal policy
- bandit problems
- state space
- polynomial time complexity
- bayesian decision problems
- np complete problems
- phase transition
- objective function
- utility function
- machine learning