CSDL - Proceedings C

Preface (PDF)

pp. x

Conference Organization (PDF)

pp. xi

Best Paper Award (PDF)

pp. xii

Ron Book Prize for Best Student Paper (PDF)

pp. xiii

Session 1- Chair: Peter Bro Miltersen, University of Aarhus

In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time (Abstract)

Russell Impagliazzo, University of California, San Diego

Valentine Kabanets, Institute for Advanced Study

Avi Wigderson, Hebrew University

pp. 0002

PDF

Towards Uniform AC⁰ -Isomorphisms (Abstract)

Manindra Agrawal, IIT Kanpur

pp. 0013

PDF

Universal Traversal Sequences with Backtracking (Abstract)

Michal Koucky, Rutgers University

pp. 0021

PDF

Comparing Notions of Full Derandomization (Abstract)

Lance Fortnow, NEC Research Institute

pp. 0028

PDF

Session 2 - Chair: Toniann Pitassi

Monotone Simulations of Nonmonotone Proofs (Abstract)

Albert Atserias, Universitat Polit?cnica de Catalunya

Nicola Galesi, Institute for Advanced Study

Pavel Pudlak, Mathematical Institute AVCR

pp. 0036

PDF

Space Complexity of Random Formulae in Resolution (Abstract)

Eli Ben-Sasson, Hebrew University

Nicola Galesi, Institute for Advanced Study

pp. 0042

PDF

Resolution Complexity of Independent Sets in Random Graphs (Abstract)

Paul Beame, University of Washington

Ashish Sabharwal, University of Washington

Russell Impagliazzo, University of California, San Diego

pp. 0052

PDF

Tree Resolution Proofs of the Weak Pigeon-Hole Principle (Abstract)

Stefan Dantchev, University of Aarhus

Søren Riis, Queen Mary, University of London

pp. 0069

PDF

Session 3 - Chair: D. Sivakumar, IBM Almaden

Separation of NP-Completeness Notions (Abstract)

A. Pavan, University at Buffalo, New York

Alan L. Selman, University at Buffalo, New York

pp. 0078

PDF

Bounded Query Functions with Limited Output Bits (Abstract)

Richard Chang, University of Maryland Baltimore County

Jon Squire, University of Maryland Baltimore County

pp. 0090

PDF

Session 4 - Chair: Rainer Schuler, University Ulm

A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity (Abstract)

Jurgen Forster, Ruhr-Universit?t Bochum

pp. 0100

PDF

Towards Proving Strong Direct Product Theorems (Abstract)

Ronen Shaltiel, Hebrew University, Jerusalem, Israel.

pp. 0107

PDF

Session 5 - Chair: Richard Cleve, University Calgary

Communication Complexity Lower Bounds by Polynomials (Abstract)

Harry Buhrman, CWI

Ronald de Wolf, CWI

pp. 0120

PDF

Quantum Algorithms for Element Distinctness (Abstract)

Harry Buhrman, CWI

Ronald de Wolf, CWI

Christoph Dürr, Universit? Paris-Sud

Mark Heiligman, NSA

Peter Høyer, University of Calgary

Frédéric Magniez, CNRS-LRI

Miklos Santha, CNRS-LRI

pp. 0131

PDF

Quantum versus Classical Learnability (Abstract)

Rocco A. Servedio, Harvard University

Steven J. Gortler, Harvard University

pp. 0138

PDF

Session 6 - Chair: Anna Gal, University Texas, Austin

Uniform Circuits for Division: Consequences and Problems (Abstract)

Eric Allender, Rutgers University

David A. Mix Barrington, University of Massachusetts

William Hesse, University of Massachusetts

pp. 0150

PDF

Affine Projections of Symmetric Polynomials (Abstract)

Amir Shpilka, Hebrew University

pp. 0160

PDF

On the Non-Approximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs (Abstract)

Beate Bollig, FB Informatik

Martin Sauerhoff, FB Informatik

Ingo Wegener, FB Informatik

pp. 0172

PDF

Lower Bounds for Approximations by Low Degree Polynomials Over Z_m (Abstract)

Noga Alon, Tel Aviv University

Richard Beigel, Temple University

pp. 0184

PDF

On the Power of Nonlinear Secret-Sharing (Abstract)

Amos Beimel, Ben-Gurion University

Yuva Ishai, DIMACS and AT&T Labs-Research

pp. 0188

PDF

Session 7 - Chair: D. Sivakumar, IBM Almaden

A Stronger Kolmogorov Zero-One Law for Resource-Bounded Measure (Abstract)

Jack Jie Dai, Iowa State University

pp. 0204

PDF

Hausdorff Dimension in Exponential Time (Abstract)

Klaus Ambos-Spies, Universit?t Heidelberg

Wolfgang Merkle, Universit?t Heidelberg

Jan Reimann, Universit?t Heidelberg

Frank Stephan, Universit?t Heidelberg

pp. 0210

PDF

Session 8 - Chair: Salil Vadhan, IAS & Harvard University

On the Complexity of Approximating the VC Dimension (Abstract)

Elchanan Mossel, Microsoft Research

Christopher Umans, Microsoft Research

pp. 0220

PDF

Links Between Complexity Theory and Constrained Block Coding (Abstract)

Larry Stockmeyer, IBM Almaden Research Center

Dharmendra S. Modha, Treelet, Inc.

pp. 0226

PDF

Simple Analysis of Graph Tests for Linearity and PCP (Abstract)

Johan Håstad, Royal Institute of Technology, Stockholm

Avi Wigderson, Hebrew University and Institute for Advanced Study

pp. 0244

PDF

Session 9 - Chair: Madhu Sudan, MIT

Logical Operations and Kolmogorov Complexity II (Abstract)

Andrei A. Muchnik, Institute of New Technologies, Moscow

Nikolai K. Vereshchagin, Moscow State University

pp. 0256

PDF

Computational Depth (Abstract)

Luis Antunes, University of Porto

Lance Fortnow, NEC Research Institute

Dieter Van Melkebeek, Institute for Advanced Study

pp. 0266

PDF

Quantum Algorithmic Entropy (Abstract)

Peter Gács, Boston University

pp. 0274

PDF

Session 10 - Chair: Uriel Feige, Weizmann Institute

On Separators, Segregators and Time versus Space (Abstract)

Rahul Santhanam, University of Chicago

pp. 0286

PDF

Time-Space Tradeoffs in the Counting Hierarchy (Abstract)

Eric Allender, Rutgers University

Michal Koucký, Rutgers University

Detlef Ronneburger, Rutgers University

Sambudda Roy, Rutgers University

V. Vinay, Indian Institute of Science

pp. 0295

PDF

Author Index (PDF)

pp. 0303