68 search results - page 5 / 14 » stoc 2004 |
STOC
2004
ACM
14 years 11 months ago
2004
ACM
In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree:
STOC
2004
ACM
14 years 11 months ago
2004
ACM
STOC
2004
ACM
14 years 11 months ago
2004
ACM
We revisit the problem of hardness amplification in NP, as recently studied by O'Donnell (STOC `02). We prove that if NP has a balanced function f such that any circuit of si...
STOC
2004
ACM
14 years 11 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 11 months ago
2004
ACM
We show that the hit-and-run random walk mixes rapidly starting from any interior point of a convex body. This is the first random walk known to have this property. In contrast, t...