Hard Promise Problems and Nonuniform Complexity.
Luc LongpréAlan L. SelmanPublished in: Theor. Comput. Sci. (1993)
Keyphrases
- solving problems
- optimization problems
- application domains
- artificial intelligence
- case study
- practical problems
- problems involving
- np complete
- linear programming
- polynomial hierarchy
- computationally hard
- mathematical programming
- benchmark problems
- decision problems
- databases
- multi class
- computational cost
- hidden markov models
- multi objective
- knowledge base
- neural network