Preface

Committees and Acknowledgments (PDF)

pp. ix

Ron Book Prize for Best Student Paper (PDF)

pp. x

Joint STOC/Complexity Session

Short Proofs are Narrow - Resolution Made Simple (Abstract)

Eli Ben-Sasson, Hebrew University

Avi Wigderson, Hebrew University

pp. 2

PDF

On the Complexity of Diophantine Geometry in Low Dimensions (Abstract)

J. Maurice Rojas, City University of Hong Kong

pp. 3

PDF

Pseudorandom Generators without the XOR Lemma (Abstract)

Madhu Sudan, Massachusetts Institute of Technology

Salil Vadhan, Massachusetts Institute of Technology

Luca Trevisan, Columbia University

pp. 4

PDF

Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (Abstract)

Sam Buss, University of California at San Diego

Russell Impagliazzo, University of California at San Diego

Dima Grigoriev, IMR Universite Rennes-1

Toniann Pitassi, University of Arizona

pp. 5

PDF

Graph Ramsey Theory and the Polynomial Hierarchy (Abstract)

Marcus Schaefer, University of Chicago

pp. 6

PDF

The Communication Complexity of Pointer Chasing Applications of Entropy and Sampling (Abstract)

Stephen J. Ponzio, Integrated Objects

Jaikumar Radhakrishnan, Tata Institute of Fundamental Research

S. Venkatesh, Tata Institute of Fundamental Research

pp. 7

PDF

Session 1

A Lower Bound for Primality (Abstract)

Eric Allender, Rutgers University

Michael Saks, Rutgers University

Igor Shparlinski, Macquarie University

pp. 10

PDF

Non-Automatizability of Bounded-Depth Frege Proofs (Abstract)

Maria Luisa Bonet, Universit?t Polit?cnica de Catalunya

Carlos Domingo, Universit?t Polit?cnica de Catalunya

Ricard Gavalda, Universit?t Polit?cnica de Catalunya

Alexis Maciel, Clarkson University

Toniann Pitassi, University of Arizona

pp. 15

PDF

On Monotone Planar Circuits (Abstract)

David A. Mix Barrington, University of Massachusetts

Chi-Jen Lu, National Chi-Nan University

Peter Bro Miltersen, University of Aarhus

Sven Skyum, University of Aarhus

pp. 24

PDF

Session 2

Computing From Partial Solutions (Abstract)

Anna Gál, University of Texas at Austin

Shai Halevi, IBM

Erez Petrank, IBM

Richard Lipton, Princeton University and Bellcore Research

pp. 34

PDF

Proofs, Codes, and Polynomial-Time Reducibilities (Abstract)

Ravi Kumar, IBM

D. Sivakumar, University of Houston

pp. 46

PDF

Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK (Abstract)

Oded Goldreich, Weizmann Institute of Science

Salil Vadhan, Massachusetts Institute of Technology

pp. 54

PDF

Invited Speaker 1

De-Randomizing BPP: The State of the Art (Abstract)

Avi Wigderson, Hebrew University

pp. 76

PDF

Session 3

The Complexity of Solving Equations Over Finite Groups (Abstract)

Mikael Goldmann, Royal Institute of Technology

Alexander Russell, University of California at Berkeley

pp. 80

PDF

Depth-3 Arithmetic Formulae over Fields of Characteristic Zero (Abstract)

Amir Shpilka, Hebrew University

Avi Wigderson, Hebrew University

pp. 87

PDF

Session 4

Stronger Separations for Random-Self-Reducibility, Rounds, and Advice (Abstract)

László Babai, University of Chicago

Sophie Laplante, Universit? Paris-Sud

pp. 98

PDF

The Expected Size of Heilbronn's Triangles (Abstract)

Tao Jiang, McMaster University

Ming Liy, University of Waterloo

Paul Vitányi, CWI and University of Amsterdam

pp. 105

PDF

Upper Semilattice of Binary Strings with the Relation "x is Simple Conditional to y" (Abstract)

Andrei Muchnik, Institute of New Technologies

Andrei Romashchenko, Moscow State University

Nikolai Vereshchagin, Moscow State University

Alexander Shen, Institute of Problems of Information Transmission

pp. 114

PDF

Session 5

Gaps in Bounded Query Hierarchies (Abstract)

Richard Beigel, University of Illinois at Chicago

pp. 124

PDF

Query Order and NP-Completeness (Abstract)

Jack J. Dai, Iowa State University

Jack H. Lutz, Iowa State University

pp. 142

PDF

Quantum Bounded Query Complexity (Abstract)

Harry Buhrman, C.W.I

Wilm Van Dam, University of Oxford

pp. 149

PDF

Invited Speaker 2

Some Recent Progress on the Complexity of Lattice Problems (Abstract)

Jin-Yi Cai, State University of New York at Buffalo

pp. 158

PDF

Session 6

Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity (Abstract)

John Watrous, Universit? de Montr?al

pp. 180

PDF

Deterministic Amplification of Space-Bounded Probabilistic Algorithms (Abstract)

Ziv Bar-Yossef, University of California at Berkeley

Oded Goldreich, Weizmann Institute of Science

Avi Wigderson, The Hebrew University of Jerusalem

pp. 188

PDF

Session 7

A Note on the Shortest Lattice Vector Problem (Abstract)

Ravi Kumar, IBM

D. Sivakumar, University of Houston

pp. 200

PDF

Applications of a New Transference Theorem to Ajtai's Connection Factor (Abstract)

Jin-Yi Cai, State University of New York at Buffalo

pp. 205

PDF

Learning DNF by Approximating Inclusion-Exclusion Formulae (Abstract)

Jun Tarui, University of Electro-Communications

Tatsuie Tsukiji, Nagoya University

pp. 215

PDF

Session 8

Circuit Lower Bounds Collapse Relativized Complexity Classes (Abstract)

Richard Beigel, University of Illinois at Chicago

Alexis Maciel, Clarkson University

pp. 222

PDF

Complicated Complementations (Abstract)

Harry Buhrman, CWI

Leen Torenvliet, University of Amsterdam

pp. 227

PDF

The Complexity of k-SAT (Abstract)

Russell Impagliazzo, University of California at San Diego

Ramamohan Paturi, University of California at San Diego

pp. 237

PDF

Author Index (PDF)

pp. 241