Sciweavers

15033 search results - page 167 / 3007
» Complexity Theory and Algorithms
Sort
View
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 4 months 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
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
16 years 4 months ago
The complexity of approximating entropy
Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt R...
SODA
2010
ACM
178views Algorithms» more  SODA 2010»
16 years 1 months ago
Basis Reduction, and the Complexity of Branch-and-Bound
Gabor Pataki, Mustafa Tural