Computational Complexity, 2005. Proceedings. Twentieth Annual IEEE Conference on
Date 11-15 June 2005
Filter Results
Displaying Results 1 - 25 of 38
-
Twentieth Annual IEEE Conference on Computational Complexity - Cover
|
PDF (59 KB)
-
Twentieth Annual IEEE Conference on Computational Complexity - Title Page
|
PDF (38 KB)
-
Twentieth Annual IEEE Conference on Computational Complexity - Copyright Page
|
PDF (46 KB)
-
Twentieth Annual IEEE Conference on Computational Complexity - Table of contents
|
PDF (32 KB)
-
Preface
|
PDF (15 KB)
-
Committees
|
PDF (16 KB)
-
-
-
-
-
-
A direct sum theorem for corruption and the multiparty NOF communication complexity of set disjointness
|
PDF (320 KB)
-
-
-
-
-
On the Fourier spectrum of symmetric Boolean functions with applications to learning symmetric juntas
|
PDF (168 KB)
-
Short PCPs verifiable in polylogarithmic time
|
PDF (312 KB)
-
-
-
Hardness of Max 3SAT with no mixed clauses
|
PDF (184 KB)
-
-
On the complexity of hardness amplification
|
PDF (248 KB)
-
-
