Optimal Quantum Adversary Lower Bounds for Ordered Search.
Andrew M. ChildsTroy LeePublished in: ICALP (1) (2008)
Keyphrases
- lower bound
- exhaustive search
- upper bound
- optimal solution
- search algorithm
- worst case
- search space
- branch and bound
- user queries
- objective function
- search queries
- lower and upper bounds
- optimal cost
- dynamic programming
- search efficiency
- lower bounding
- branch and bound algorithm
- solution space
- quadratic assignment problem