STOC
2006
ACM
14 years 5 months ago
2006
ACM
STOC
2006
ACM
14 years 5 months ago
2006
ACM
We revisit the general RL vs. L question, obtaining the following results.
STOC
2006
ACM
14 years 5 months ago
2006
ACM
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...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
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 ...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
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...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
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...
STOC
2006
ACM
14 years 11 months ago
2006
ACM
STOC
2006
ACM
14 years 11 months ago
2006
ACM
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...
STOC
2006
ACM
14 years 11 months ago
2006
ACM
: 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...
STOC
2006
ACM
14 years 11 months ago
2006
ACM
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...