Generic-Group Lower Bounds via Reductions Between Geometric-Search Problems: With and Without Preprocessing.
Benedikt AuerbachCharlotte HoffmannGuillermo Pascual-PerezPublished in: TCC (3) (2023)
Keyphrases
- search problems
- lower bound
- preprocessing
- search algorithm
- orders of magnitude
- heuristic search
- upper bound
- state space search
- efficient search
- branch and bound
- search strategies
- solving hard
- heuristic search algorithms
- iterative deepening
- domain specific
- branch and bound algorithm
- objective function
- parallel processors
- np hard
- search space
- feature extraction
- optimal solution
- machine learning
- constraint satisfaction problems
- planning problems
- parallel version