Sciweavers

STOC
2004
ACM
142views Algorithms» more  STOC 2004»
14 years 4 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson