The Community for Technology Leaders
18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. (2003)
Aarhus, Denmark
July 7, 2003 to July 10, 2003
ISSN: 1093-0159
ISBN: 0-7695-1879-6

Preface (PDF)

pp. x

Committees (PDF)

pp. xi
Session 1

Extremal properties of polynomial threshold functions (Abstract)

Ryan O'Donnell , Department of Mathematics MIT
Rocco A. Servedio , Columbia University
pp. 3

Bounded Nondeterminism and Alternation in Parameterized Complexity Theory (Abstract)

Yijia Chen , Albert-Ludwigs-Universitat Freiburg
Jorg Flum , Albert-Ludwigs-Universitat Freiburg
pp. 13
Session 2

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

Dan Gutfreund , The Hebrew University of Jerusalem, Israel, 91904
pp. 33
Session 3

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

Pranab Sen , Department of Combinatorics and Optimization, University of Waterloo,
pp. 73

Minimization of Decision Trees Is Hard to Approximate (Abstract)

Detlef Sieling , Department of Computer Science, RWTH Aachen,
pp. 84
Session 4

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

Xiaodong Sun , Institute for Advanced Study
Subhash Khot , Princeton University
Xiaodong Sun , Institute for Advanced Study
pp. 107
Invited Talk

Parameterized Complexity for the Skeptic (Abstract)

Rod Downey , Victoria University
pp. 147
Session 6

Quantum Certificate Complexity (Abstract)

Scott Aaronson , University of California, Berkeley
pp. 171

Quantum query complexity and semi-definite programming (Abstract)

Howard Barnum , Los Alamos National Laboratory
Michael Saks , Rutgers University
Mario Szegedy , Rutgers University
pp. 179
Session 7

Derandomization and Distinguishing Complexity (Abstract)

Eric Allender , Rutgers University
Michal Koucky , Rutgers University
Detlef Ronneburger , Rutgers University
Sambuddha Roy , Rutgers University
pp. 209

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

Andrei Romashchenko , Institute for Information Transmission Problems
pp. 221

The complexity of stochastic sequences (Abstract)

Wolfgang Merkle , Ruprecht-Karls-Universitat Heidelberg
pp. 230
Session 8

A Combinatorial Characterization of ResolutionWidth (Abstract)

Albert Atserias , Universital Politecnica de Catalunya
V? Dalmau , Universitat Pompeu Fabra
pp. 239

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
Invited Talk

Inapproximability Some history and some open problems (PDF)

Johan Hastad , Royal Institute of Technology
pp. 265
Session 10

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

List Decoding with Side Information (Abstract)

Venkatesan Guruswami , University of Washington
pp. 300
Session 11

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

Are Cook and Karp Ever the Same? (Abstract)

Richard Beigel , Temple University
Lance Fortnow , NEC Laboratories America
pp. 333

Universal Languages and the Power of Diagonalization (Abstract)

Alan Nash ,
Russell Impagliazzo ,
Jeff Remmel , University of California, San Diego, CA 92093
pp. 337
Invited Talk

On Derandomizing Tests for Certain Polynomial Identities (Abstract)

Manindra Agrawal , Dept of CSE, IIT Kanpur 208016, India
pp. 355
Session 13

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

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

Subhash Khot , Princeton University
Oded Regev , Institute for Advanced Study
pp. 379
Author Index

Author Index (PDF)

pp. 387
85 ms
(Ver 3.3 (11022016))