CSDL - Proceedings C

Committees (PDF)

pp. ix

Awards (PDF)

pp. x

ECCC 10th Anniversary (PDF)

pp. xi

Session 1

Compression of Samplable Sources (Abstract)

Luca Trevisan, University of California at Berkeley

Salil Vadhan, Harvard University

David Zuckerman, University of Texas

pp. 1-14

PDF

Language Compression and Pseudorandom Generators (Abstract)

Harry Buhrman, CWI and University of Amsterdam

Troy Lee, CWI and University of Amsterdam

Dieter van Melkebeek, University of Wisconsin-Madison

pp. 15-28

PDF

On Pseudoentropy versus Compressibility (Abstract)

Hoeteck Wee, University of California at Berkeley

pp. 29-41

PDF

Session 2

Reductions between Disjoint NP-Pairs (Abstract)

Christian Glaßer, Universität Würzburg

Alan L. Selman, University at Buffalo

Samik Sengupta, University at Buffalo

pp. 42-53

PDF

Relativized NP Search Problems and Propositional Proof Systems (Abstract)

Joshua Buresh-Oppenheim, University of Toronto

Tsuyoshi Morioka, University of Toronto

pp. 54-67

PDF

The Complexity of Treelike Systems over λ-Local Formulae (Abstract)

Nicola Galesi, Universitat Politécnica de Catalunya

Neil Thapen, University of Toronto

pp. 68-74

PDF

Session 3

Lower Bounds for Testing Bipartiteness in Dense Graphs (Abstract)

Andrej Bogdanov, University of California at Berkeley

Luca Trevisan, University of California at Berkeley

pp. 75-81

PDF

Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential Hierarchy (Abstract)

Alan L. Selman, University at Buffalo

Samik Sengupta, University at Buffalo

pp. 82-90

PDF

Solvable Group Isomorphism is (almost) in NP ∩ CoNP (Abstract)

V. Arvind, Institute of Mathematical Sciences

Jacobo Torán, Universität Ulm

pp. 91-103

PDF

Small Spans in Scaled Dimension (Abstract)

John M. Hitchcock, University of Wyoming

pp. 104-112

PDF

Session 4

Computing in Fault Tolerance Broadcast Networks (Abstract)

Ilan Newman, University of Haifa

pp. 113-122

PDF

Some Results on Majority Quantifiers over Words (Abstract)

Klaus-Jörn Lange, Eberhard-Karls-Universität Tübingen

pp. 123-129

PDF

Separating Complexity Classes Using Structural Properties (Abstract)

Harry Buhrman, Centrum voor Wiskunde en Informatica

Leen Torenvliet, University of Amsterdam

pp. 130-138

PDF

Session 5

Parameterized Complexity of Constraint Satisfaction Problems (Abstract)

Dániel Marx, Budapest University of Technology and Economics

pp. 139-149

PDF

Tight Lower Bounds for Certain Parameterized NP-Hard Problems (Abstract)

Jianer Chen, Texas A&M University

Benny Chor, Tel-Aviv University

Mike Fellows, University of Newcastle

Xiuzhen Huang, Texas A&M University

David Juedes, Ohio University

Iyad Kanj, DePaul University

Ge Xia, Texas A&M University

pp. 150-160

PDF

The Complexity of the Covering Radius Problem on Lattices and Codes (Abstract)

Venkatesan Guruswami, University of Washington

Daniele Micciancio, University of California at San Diego

Oded Regev, Tel-Aviv University

pp. 161-173

PDF

Session 6

Dimension, Entropy Rates, and Compression (Abstract)

John M. Hitchcock, University of Wyoming

N. V. Vinodchandran, University of Nebraska-Lincoln

pp. 174-183

PDF

Properties of NP-Complete Sets (Abstract)

Christian Gla?er, Universit?t W?rzburg

A. Pavan, Iowa State University

Alan L. Selman, University at Buffalo

Samik Sengupta, University at Buffalo

pp. 184-197

PDF

Partial Bi-immunity and NP-Completeness (Abstract)

John M. Hitchcock, University of Wyoming

A. Pavan, Iowa State University

N. V. Vinodchandran, University of Nebraska-Lincoln

pp. 198-203

PDF

Session 7

Abelian Permutation Group Problems and Logspace Counting Classes (Abstract)

V. Arvind, Institute ofMathematical Sciences

T.C. Vijayaraghavan, Institute ofMathematical Sciences

pp. 204-214

PDF

Deterministic Polynomial Identity Testing in Non-Commutative Models (Abstract)

Ran Raz, Weizmann Institute of Science

Amir Shpilka, Weizmann Institute of Science

pp. 215-222

PDF

Polynomials That Sign Represent Parity and Descartes Rule of Signs (Abstract)

Saugata Basu, Georgia Tech

Nayantara Bhatnagar, Georgia Tech

Parikshit Gopalan, Georgia Tech

Richard J. Lipton, Georgia Tech

pp. 223-235

PDF

Session 8

Consequences and Limits of Nonlocal Strategies (Abstract)

Richard Cleve, University of Calgary

Peter H?, University of Calgary

Benjamin Toner, California Institute of Technology

John Watrous, University of Calgary

pp. 236-249

PDF

Multiparty Quantum Coin Flipping (Abstract)

Andris Ambainis, IAS and U. of Latvia

Harry Buhrman, CWI and U. of Amsterdam

Yevgeniy Dodis, New York University

Hein Röhrig, U. of Calgary

pp. 250-259

PDF

On the Power of Quantum Proofs (Abstract)

Ran Raz, Weizmann Institute of Science

Amir Shpilka, Weizmann Institute of Science

pp. 260-274

PDF

Quantum Arthur-Merlin Games (Abstract)

Chris Marriott, University of Calgary

John Watrous, University of Calgary

pp. 275-285

PDF

Session 9

Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go? (Abstract)

Xiaoming Sun, Tsinghua University

Andrew C. Yao, Princeton University

Shengyu Zhang, Princeton University

pp. 286-293

PDF

Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments (Abstract)

Sophie Laplante, LRI, Université Paris-Sud

Frédéric Magniez, LRI, CNRS

pp. 294-304

PDF

Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information (Abstract)

Andris Ambainis, Institute for Advanced Studies

Ke Yang, Carnegie Mellon University

pp. 305-319

PDF

Limitations of Quantum Advice and One-Way Communication (Abstract)

Scott Aaronson, University of California at Berkeley

pp. 320-332

PDF

Author Index

Author Index (PDF)

pp. 333