STOC
2004
ACM
14 years 12 months ago
2004
ACM
STOC
2004
ACM
14 years 12 months ago
2004
ACM
Given d (0, ) let kd be the smallest integer k such that d < 2k log k. We prove that the chromatic number of a random graph G(n, d/n) is either kd or kd + 1 almost surely.
STOC
2004
ACM
14 years 12 months ago
2004
ACM
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
STOC
2004
ACM
14 years 12 months ago
2004
ACM
