FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
Every compact orientable boundaryless surface M can be cut along simple loops with a common point v0, pairwise disjoint except at v0, so that the resulting surface is a topologica...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
d abstract) Nathan Segerlind∗ Sam Buss† Russell Impagliazzo‡ We prove a new switching lemma that works for restrictions that set only a small fraction of the variables and i...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We present the first explicit connection between quantum computation and lattice problems. Namely, our main result is a solution to the Unique Shortest Vector Problem (SVP) under ...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
A principle task in parallel and distributed systems is to reduce the communication load in the interconnection network, as this is usually the major bottleneck for the performanc...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
A standard load balancing model considers placing Ò balls into Ò bins by choosing possible locations for each ball independently and uniformly at random and sequentially placing...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We introduce LT codes, the first rateless erasure codes that are very efficient as the data length grows.