Date 21-24 May 2002
Filter Results
Displaying Results 1 - 25 of 38
-
Proceedings 17th IEEE Annual Conference on Computational Complexity [front matter]
|
PDF (322 KB)
-
Author index
|
PDF (179 KB)
-
Expanders from symmetric codes
|
PDF (264 KB)
-
The complexity of approximating the entropy
|
PDF (225 KB)
-
-
-
Pseudo-random generators for all hardnesses
|
PDF (216 KB)
-
-
-
Hard examples for bounded depth frege
|
PDF (209 KB)
-
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
|
PDF (223 KB)
-
Arthur and Merlin in a quantum world
|
PDF (201 KB)
-
-
Hard examples for bounded depth Frege
|
PDF (219 KB)
-
-
-
-
-
-
Universal arguments and their applications
|
PDF (417 KB)
-
-
The history of complexity
|
PDF (195 KB)
-
-
-
Hardness amplification within NP
|
PDF (232 KB)


