Sciweavers

STOC
2006
ACM
117views Algorithms» more  STOC 2006»
14 years 12 days ago
Pseudorandom walks on regular digraphs and the RL vs. L problem
We revisit the general RL vs. L question, obtaining the following results.
Omer Reingold, Luca Trevisan, Salil P. Vadhan
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 12 days ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
14 years 12 days ago
Information-theoretically secure protocols and security under composition
We investigate the question of whether security of protocols in the information-theoretic setting (where the adversary is computationally unbounded) implies the security of these ...
Eyal Kushilevitz, Yehuda Lindell, Tal Rabin
STOC
2006
ACM
112views Algorithms» more  STOC 2006»
14 years 12 days ago
Limitations of quantum coset states for graph isomorphism
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
Sean Hallgren, Cristopher Moore, Martin Rötte...
STOC
2006
ACM
113views Algorithms» more  STOC 2006»
14 years 12 days ago
Logarithmic hardness of the directed congestion minimization problem
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
Matthew Andrews, Lisa Zhang
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
14 years 6 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
14 years 6 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 6 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang