CSDL - Proceedings C

Preface (PDF)

pp. x

Committees (PDF)

pp. xi

Ronald V. Book Prize for Best Student Paper (PDF)

pp. xii

2003 Best Paper Award (PDF)

pp. xiii

Session 1

null

Extremal properties of polynomial threshold functions (Abstract)

Ryan O'Donnell, Department of Mathematics MIT

Rocco A. Servedio, Columbia University

pp. 3

PDF

Bounded Nondeterminism and Alternation in Parameterized Complexity Theory (Abstract)

Yijia Chen, Albert-Ludwigs-Universitat Freiburg

Jorg Flum, Albert-Ludwigs-Universitat Freiburg

pp. 13

PDF

Session 2

null

Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games (Abstract)

Dan Gutfreund, The Hebrew University of Jerusalem, Israel, 91904

pp. 33

PDF

A zero one law for RP (Abstract)

Russell Impagliazzo

Philippe Moser

pp. 48

PDF

Hardness vs. Randomness within Alternating Time (Abstract)

Emanuele Viola, Harvard University

pp. 53

PDF

Session 3

null

Lower bounds for predecessor searching in the cell probe model (Abstract)

Pranab Sen, Department of Combinatorics and Optimization, University of Waterloo,

pp. 73

PDF

Minimization of Decision Trees Is Hard to Approximate (Abstract)

Detlef Sieling, Department of Computer Science, RWTH Aachen,

pp. 84

PDF

Optimal Separation of EROW and CROWPRAMs (Abstract)

pp. 93

PDF

Session 4

null

Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness (Abstract)

Amit Chakrabarti

Subhash Khot

Xiaodong Sun, Institute for Advanced Study

Subhash Khot, Princeton University

Xiaodong Sun, Institute for Advanced Study

pp. 107

PDF

Rectangle Size Bounds and Threshold Covers in Communication Complexity (Abstract)

Hartmut Klauck, Institute for Advanced Study

pp. 118

PDF

The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs (Abstract)

Chris Calabro, University of California, San Diego

pp. 135

PDF

Session 5

null

Invited Talk

Parameterized Complexity for the Skeptic (Abstract)

Rod Downey, Victoria University

pp. 147

PDF

Session 6

null

Quantum Certificate Complexity (Abstract)

Scott Aaronson, University of California, Berkeley

pp. 171

PDF

Quantum query complexity and semi-definite programming (Abstract)

Howard Barnum, Los Alamos National Laboratory

Michael Saks, Rutgers University

Mario Szegedy, Rutgers University

pp. 179

PDF

On Statistical Query Sampling and NMR Quantum Computing (Abstract)

Ke Yang

Avrim Blum

pp. 194

PDF

Session 7

null

Derandomization and Distinguishing Complexity (Abstract)

Eric Allender, Rutgers University

Michal Koucky, Rutgers University

Detlef Ronneburger, Rutgers University

Sambuddha Roy, Rutgers University

pp. 209

PDF

Extracting the Mutual Information for a Triple of Binary Strings (Abstract)

Andrei Romashchenko, Institute for Information Transmission Problems

pp. 221

PDF

The complexity of stochastic sequences (Abstract)

Wolfgang Merkle, Ruprecht-Karls-Universitat Heidelberg

pp. 230

PDF

Session 8

null

A Combinatorial Characterization of ResolutionWidth (Abstract)

Albert Atserias, Universital Politecnica de Catalunya

V? Dalmau, Universitat Pompeu Fabra

pp. 239

PDF

Memoization and DPLL: Formula Caching Proof Systems (Abstract)

Paul Beame, University of Washington

Russell Impagliazzo, UC, San Diego

Toniann Pitassi, University of Toronto

Nathan Segerlind, UC, San Diego

pp. 248

PDF

Session 9

null

Inapproximability Some history and some open problems (PDF)

Johan Hastad, Royal Institute of Technology

pp. 265

Session 10

null

Holographic Proofs and Derandomization (Abstract)

pp. 269

PDF

Three-Query PCPs with Perfect Completeness over non-Boolean Domains (Abstract)

Lars Engebretsen, Royal Institute of Technology

Jonas Holmerin, Royal Institute of Technology

pp. 284

PDF

List Decoding with Side Information (Abstract)

Venkatesan Guruswami, University of Washington

pp. 300

PDF

Session 11

null

Disjoint NP-Pairs (Abstract)

Christian Gla?er, University at Buffalo, Buffalo, NY 14260

Alan L. Selman, University at Buffalo, Buffalo, NY 14260

Samik Sengupta, University at Buffalo, Buffalo, NY 14260

Liyu Zhang, University at Buffalo, Buffalo, NY 14260

pp. 313

PDF

Are Cook and Karp Ever the Same? (Abstract)

Richard Beigel, Temple University

Lance Fortnow, NEC Laboratories America

pp. 333

PDF

Universal Languages and the Power of Diagonalization (Abstract)

Alan Nash, anash@math.ucsd.edu

Russell Impagliazzo, russell@cs.ucsd.edu

Jeff Remmel, University of California, San Diego, CA 92093

pp. 337

PDF

Proving SAT does not have Small Circuits with an Application to the Two (Abstract)

pp. 347

PDF

Session 12

null

On Derandomizing Tests for Certain Polynomial Identities (Abstract)

Manindra Agrawal, Dept of CSE, IIT Kanpur 208016, India

pp. 355

PDF

Session 13

null

Improved Inapproximability of Lattice and Coding Problems with Preprocessing (Abstract)

Oded Regev, Institute for Advanced Study

pp. 363

PDF

A Strong Inapproximability Gap for a Generalization of Minimum Bisection (Abstract)

Jonas Holmerin, Royal Institute of Technology

Subhash Khot, Princeton University, Princeton, NJ-08544.

pp. 371

PDF

Vertex Cover Might be Hard to Approximate to within 2-\varepsilon (Abstract)

Subhash Khot, Princeton University

Oded Regev, Institute for Advanced Study

pp. 379

PDF

Author Index

Author Index (PDF)

pp. 387