5138 search results - page 153 / 1028 » Randomized Algorithms for 3-SAT |
140
click to vote
SPAA
1993
ACM
15 years 7 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
122
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
106
click to vote
COCO
1991
Springer
15 years 6 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
119
click to vote
APPROX
2008
Springer
15 years 5 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...
126
click to vote
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We study the spectral norm of matrices M that can be factored as M = BA, where A is a random matrix with independent mean zero entries and B is a fixed matrix. Under the (4 + )-th ...