Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
FOCS
2002
IEEE
12 years 4 months ago
The Hardness of 3 - Uniform Hypergraph Coloring
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...
Irit Dinur, Oded Regev, Clifford D. Smyth
FOCS
2002
IEEE
12 years 4 months ago
Optimal System of Loops on an Orientable Surface
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...
Éric Colin de Verdière, Francis Laza...
FOCS
2002
IEEE
12 years 4 months ago
On Approximating the Radii of Point Sets in High Dimensions
Kasturi R. Varadarajan, Srinivasan Venkatesh, Jiaw...
FOCS
2002
IEEE
12 years 4 months ago
A Switching Lemma for Small Restrictions and Lower Bounds for k - DNF Resolution
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...
Nathan Segerlind, Samuel R. Buss, Russell Impaglia...
FOCS
2002
IEEE
12 years 4 months ago
Quantum Computation and Lattice Problems
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 ...
Oded Regev
FOCS
2002
IEEE
12 years 4 months ago
Minimizing Congestion in General Networks
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...
Harald Räcke
FOCS
2002
IEEE
12 years 4 months ago
Concurrent Zero Knowledge with Logarithmic Round-Complexity
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,...
Manoj Prabhakaran, Alon Rosen, Amit Sahai
FOCS
2002
IEEE
12 years 4 months ago
Load Balancing with Memory
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...
Michael Mitzenmacher, Balaji Prabhakar, Devavrat S...
FOCS
2002
IEEE
12 years 4 months ago
LT Codes
We introduce LT codes, the first rateless erasure codes that are very efficient as the data length grows.
Michael Luby
books