The Relative Complexity of NP Search Problems.
Paul BeameStephen A. CookJeff EdmondsRussell ImpagliazzoToniann PitassiPublished in: J. Comput. Syst. Sci. (1998)
Keyphrases
- search problems
- orders of magnitude
- search algorithm
- heuristic search
- efficient search
- computational complexity
- search space
- state space search
- search strategies
- iterative deepening
- np complete
- beam search
- solving hard
- constraint satisfaction problems
- planning problems
- constraint satisfaction
- particle swarm optimization
- optimal solution