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