Sciweavers

72 search results - page 5 / 15
» stoc 2003
Sort
View
STOC
2003
ACM
65views Algorithms» more  STOC 2003»
14 years 8 months ago
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi ...
STOC
2003
ACM
72views Algorithms» more  STOC 2003»
14 years 8 months ago
OPT versus LOAD in dynamic storage allocation
Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyo...
STOC
2003
ACM
88views Algorithms» more  STOC 2003»
14 years 8 months ago
Exponential algorithmic speedup by a quantum walk
Andrew M. Childs, Richard Cleve, Enrico Deotto, Ed...
STOC
2003
ACM
140views Algorithms» more  STOC 2003»
14 years 8 months ago
Cutting triangular cycles of lines in space
We show that n lines in 3-space can be cut into O(n2-1/69 log16/69 n) pieces, such that all depth cycles defined by triples of lines are eliminated. This partially resolves a long...
Boris Aronov, Vladlen Koltun, Micha Sharir
STOC
2003
ACM
87views Algorithms» more  STOC 2003»
14 years 8 months ago
The intrinsic dimensionality of graphs
We resolve the following conjecture raised by Levin together with Linial, London, and Rabinovich [Combinatorica, 1995]. For a graph G, let dim(G) be the smallest d such that G occ...
Robert Krauthgamer, James R. Lee