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...
STOC
2006
ACM
14 years 11 months ago
2006
ACM
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
STOC
2006
ACM
14 years 11 months ago
2006
ACM
STOC
2006
ACM
14 years 11 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
STOC
2006
ACM
14 years 11 months ago
2006
ACM
We present reductions from lattice problems in the 2 norm to the corresponding problems in other norms such as 1, (and in fact in any other p norm where 1 p ). We consider latt...
STOC
2006
ACM
14 years 11 months ago
2006
ACM
STOC
2006
ACM
14 years 11 months ago
2006
ACM
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...