Date 15-18 July 2009
Filter Results
Displaying Results 1 - 25 of 45
-
[Front cover]
|
PDF (139 KB)
-
[Title page i]
|
PDF (18 KB)
-
[Title page iii]
|
PDF (55 KB)
-
[Copyright notice]
|
PDF (104 KB)
-
Table of contents
|
PDF (175 KB)
-
Conference Information
|
PDF (111 KB)
-
-
k-Subgraph Isomorphism on AC_0 Circuits
|
PDF (412 KB)
-
Fixed-Polynomial Size Circuit Bounds
|
PDF (302 KB)
-
-
A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent
|
PDF (257 KB)
-
The Proof Complexity of Polynomial Identities
|
PDF (373 KB)
-
-
-
-
Are PCPs Inherent in Efficient Arguments?
|
PDF (353 KB)
-
Extractors for Low-Weight Affine Sources
|
PDF (316 KB)
-
Extractors for Varieties
|
PDF (361 KB)
-
-
-
-
-
-
-
The Complexity of the Annihilating Polynomial
|
PDF (374 KB)


