7 search results - page 1 / 2 » Quantum and Randomized Lower Bounds for Local Search on Vert... |
APPROX
2008
Springer
13 years 8 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
STOC
2006
ACM
14 years 6 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
STOC
2004
ACM
14 years 6 months ago
2004
ACM
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...
FOCS
2006
IEEE
14 years 3 days ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
FOCS
2003
IEEE
13 years 11 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...