Approximate counting and NP search problems.
Leszek Aleksander KolodziejczykNeil ThapenPublished in: CoRR (2018)
Keyphrases
- search problems
- search algorithm
- orders of magnitude
- heuristic search
- search strategies
- efficient search
- state space search
- solving hard
- iterative deepening
- np complete
- search space
- beam search
- parallel processors
- heuristic search algorithms
- computational complexity
- constraint satisfaction problems
- combinatorial search
- np hard
- objective function
- systematic search algorithms
- planning problems
- general purpose