The Community for Technology Leaders
2012 IEEE 27th Conference on Computational Complexity (1999)
Atlanta, Georgia
May 4, 1999 to May 6, 1999
ISSN: 1093-0159
ISBN: 0-7695-0075-7
TABLE OF CONTENTS

Preface (PDF)

pp. viii
Joint STOC/Complexity Session

Short Proofs are Narrow - Resolution Made Simple (Abstract)

Eli Ben-Sasson , Hebrew University
Avi Wigderson , Hebrew University
pp. 2

Pseudorandom Generators without the XOR Lemma (Abstract)

Salil Vadhan , Massachusetts Institute of Technology
Madhu Sudan , Massachusetts Institute of Technology
Luca Trevisan , Columbia University
pp. 4

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

Russell Impagliazzo , University of California at San Diego
Toniann Pitassi , University of Arizona
Dima Grigoriev , IMR Universite Rennes-1
Sam Buss , University of California at San Diego
pp. 5

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

Jaikumar Radhakrishnan , Tata Institute of Fundamental Research
Stephen J. Ponzio , Integrated Objects
S. Venkatesh , Tata Institute of Fundamental Research
pp. 7
Session 1

A Lower Bound for Primality (Abstract)

Eric Allender , Rutgers University
Igor Shparlinski , Macquarie University
Michael Saks , Rutgers University
pp. 10

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

Carlos Domingo , Universit?t Polit?cnica de Catalunya
Ricard Gavalda , Universit?t Polit?cnica de Catalunya
Maria Luisa Bonet , Universit?t Polit?cnica de Catalunya
Alexis Maciel , Clarkson University
Toniann Pitassi , University of Arizona
pp. 15

On Monotone Planar Circuits (Abstract)

Chi-Jen Lu , National Chi-Nan University
Sven Skyum , University of Aarhus
Peter Bro Miltersen , University of Aarhus
David A. Mix Barrington , University of Massachusetts
pp. 24
Session 2

Computing From Partial Solutions (Abstract)

Anna Gál , University of Texas at Austin
Richard Lipton , Princeton University and Bellcore Research
pp. 34

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

Salil Vadhan , Massachusetts Institute of Technology
Oded Goldreich , Weizmann Institute of Science
pp. 54
Invited Speaker 1

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

Avi Wigderson , Hebrew University
pp. 76
Session 3

The Complexity of Solving Equations Over Finite Groups (Abstract)

Alexander Russell , University of California at Berkeley
Mikael Goldmann , Royal Institute of Technology
pp. 80
Session 4

The Expected Size of Heilbronn's Triangles (Abstract)

Paul Vitányi , CWI and University of Amsterdam
Ming Liy , University of Waterloo
Tao Jiang , McMaster University
pp. 105

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

Andrei Muchnik , Institute of New Technologies
Nikolai Vereshchagin , Moscow State University
Alexander Shen , Institute of Problems of Information Transmission
Andrei Romashchenko , Moscow State University
pp. 114
Session 5

Gaps in Bounded Query Hierarchies (Abstract)

Richard Beigel , University of Illinois at Chicago
pp. 124

Query Order and NP-Completeness (Abstract)

Jack H. Lutz , Iowa State University
Jack J. Dai , Iowa State University
pp. 142

Quantum Bounded Query Complexity (Abstract)

Wilm Van Dam , University of Oxford
pp. 149
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
Session 6

Deterministic Amplification of Space-Bounded Probabilistic Algorithms (Abstract)

Oded Goldreich , Weizmann Institute of Science
Avi Wigderson , The Hebrew University of Jerusalem
Ziv Bar-Yossef , University of California at Berkeley
pp. 188
Session 7

A Note on the Shortest Lattice Vector Problem (Abstract)

D. Sivakumar , University of Houston
pp. 200

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

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

Learning DNF by Approximating Inclusion-Exclusion Formulae (Abstract)

Jun Tarui , University of Electro-Communications
Tatsuie Tsukiji , Nagoya University
pp. 215
Session 8

Circuit Lower Bounds Collapse Relativized Complexity Classes (Abstract)

Alexis Maciel , Clarkson University
Richard Beigel , University of Illinois at Chicago
pp. 222

Complicated Complementations (Abstract)

Leen Torenvliet , University of Amsterdam
pp. 227

The Complexity of k-SAT (Abstract)

Ramamohan Paturi , University of California at San Diego
Russell Impagliazzo , University of California at San Diego
pp. 237

Author Index (PDF)

pp. 241
90 ms
(Ver )