Sciweavers

STOC
2006
ACM
166views Algorithms» more  STOC 2006»
15 years 23 days ago
New upper and lower bounds for randomized and quantum local search
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...
Shengyu Zhang