Approximate counting and NP search problems.
Leszek Aleksander KolodziejczykNeil ThapenPublished in: J. Math. Log. (2022)
Keyphrases
- search problems
- search algorithm
- orders of magnitude
- heuristic search
- search strategies
- state space search
- efficient search
- parallel processors
- solving hard
- search space
- combinatorial search
- beam search
- heuristic search algorithms
- iterative deepening
- systematic search algorithms
- general purpose
- np hard
- constraint satisfaction problems
- np complete
- computational complexity
- planning problems
- information retrieval
- branch and bound