NP-Complete Decision Problems for Binary Quadratics.
Kenneth L. MandersLeonard M. AdlemanPublished in: J. Comput. Syst. Sci. (1978)
Keyphrases
- decision problems
- np complete
- np hard
- computational complexity
- pspace complete
- conp complete
- influence diagrams
- bounded treewidth
- randomly generated
- satisfiability problem
- decision model
- optimal strategy
- multiple criteria
- utility function
- np complete problems
- decision processes
- partially observable
- exptime complete
- optimal solution
- phase transition
- conjunctive queries
- optimal policy
- sequential decision making
- special case
- lower bound
- bayesian decision problems
- bandit problems
- binary classifiers
- data complexity
- probability distribution
- machine learning
- multicriteria decision