FOCS
2008
IEEE
14 years 6 months ago
2008
IEEE
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...
FOCS
2008
IEEE
14 years 6 months ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
FOCS
2008
IEEE
14 years 6 months ago
2008
IEEE
FOCS
2008
IEEE
14 years 6 months ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
FOCS
2008
IEEE
14 years 6 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
FOCS
2008
IEEE
14 years 6 months ago
2008
IEEE
FOCS
2008
IEEE
14 years 6 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
FOCS
2008
IEEE
14 years 6 months ago
2008
IEEE
FOCS
2008
IEEE
14 years 6 months ago
2008
IEEE
FOCS
2008
IEEE
14 years 6 months ago
2008
IEEE
We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T) = O(k · n1/k ) · w(MST(M)), an...