8 search results - page 1 / 2 » Paths Beyond Local Search: A Tight Bound for Randomized Fixe... |
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
ALGORITHMICA
2010
13 years 5 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
STOC
2006
ACM
14 years 5 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...
FOCS
2006
IEEE
13 years 11 months 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...
AINA
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...