7 search results - page 2 / 2 » Quantum and Randomized Lower Bounds for Local Search on Vert... |
SLS
2009
Springer
14 years 9 days ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
ICS
2010
Tsinghua U.
14 years 3 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...