NP search problems in low fragments of bounded arithmetic.
Jan KrajícekAlan SkelleyNeil ThapenPublished in: J. Symb. Log. (2007)
Keyphrases
- search problems
- orders of magnitude
- heuristic search
- search algorithm
- search strategies
- state space search
- solving hard
- beam search
- efficient search
- search space
- heuristic search algorithms
- constraint satisfaction problems
- iterative deepening
- parallel processors
- general purpose
- truth table
- planning problems
- parallel version
- upper bound
- computational complexity