1. Home
  2. Proceedings
  3. CCC
  4. CCC 2003
Default Cover Image

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.

July 7 2003 to July 10 2003

Aarhus, Denmark

Table of Contents

Proceedings 18th IEEE Annual Conference on Computational ComplexityFreely available from IEEE.
The Legacy of Andrei KolmogorovFull-text access may be available. Sign in or learn about subscription options.pp. ix
PrefaceFreely available from IEEE.pp. x
CommitteesFreely available from IEEE.pp. xi
Ronald V. Book Prize for Best Student PaperFull-text access may be available. Sign in or learn about subscription options.pp. xii
2003 Best Paper AwardFreely available from IEEE.pp. xiii
Holographic proofs and derandomizationFull-text access may be available. Sign in or learn about subscription options.pp. 269,270,271,272,273,274,275,276,277,278,279,280,281,282,283
by R. Santhanam, D. van Melkebeek
Session 1
Extremal properties of polynomial threshold functionsFull-text access may be available. Sign in or learn about subscription options.pp. 3
by Ryan O'Donnell, Rocco A. Servedio
Session 1
Bounded Nondeterminism and Alternation in Parameterized Complexity TheoryFull-text access may be available. Sign in or learn about subscription options.pp. 13
by Yijia Chen, Jorg Flum
Session 2
Uniform hardness vs. randomness tradeoffs for Arthur-Merlin gamesFull-text access may be available. Sign in or learn about subscription options.pp. 33
by Dan Gutfreund
Session 2
A zero one law for RPFull-text access may be available. Sign in or learn about subscription options.pp. 48
by Russell Impagliazzo, Philippe Moser
Session 2
Hardness vs. Randomness within Alternating TimeFull-text access may be available. Sign in or learn about subscription options.pp. 53
by Emanuele Viola
Session 3
Lower bounds for predecessor searching in the cell probe modelFull-text access may be available. Sign in or learn about subscription options.pp. 73
by Pranab Sen
Session 3
Minimization of Decision Trees Is Hard to ApproximateFull-text access may be available. Sign in or learn about subscription options.pp. 84
by Detlef Sieling
Session 3
Optimal Separation of EROW and CROWPRAMsFull-text access may be available. Sign in or learn about subscription options.pp. 93
by Navin Goyal, Michael Saks, S. Venkatesh
Session 4
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set DisjointnessFull-text access may be available. Sign in or learn about subscription options.pp. 107
by Amit Chakrabarti, Subhash Khot, Xiaodong Sun, Subhash Khot, Xiaodong Sun
Session 4
Rectangle Size Bounds and Threshold Covers in Communication ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 118
by Hartmut Klauck
Session 4
The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFsFull-text access may be available. Sign in or learn about subscription options.pp. 135
by Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi
Invited Talk
Parameterized Complexity for the SkepticFull-text access may be available. Sign in or learn about subscription options.pp. 147
by Rod Downey
Session 6
Quantum Certificate ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 171
by Scott Aaronson
Session 6
Quantum query complexity and semi-definite programmingFull-text access may be available. Sign in or learn about subscription options.pp. 179
by Howard Barnum, Michael Saks, Mario Szegedy
Session 6
On Statistical Query Sampling and NMR Quantum ComputingFull-text access may be available. Sign in or learn about subscription options.pp. 194
by Ke Yang, Avrim Blum
Session 7
Derandomization and Distinguishing ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 209
by Eric Allender, Michal Koucky, Detlef Ronneburger, Sambuddha Roy
Session 7
Extracting the Mutual Information for a Triple of Binary StringsFull-text access may be available. Sign in or learn about subscription options.pp. 221
by Andrei Romashchenko
Session 7
The complexity of stochastic sequencesFull-text access may be available. Sign in or learn about subscription options.pp. 230
by Wolfgang Merkle
Session 8
A Combinatorial Characterization of ResolutionWidthFull-text access may be available. Sign in or learn about subscription options.pp. 239
by Albert Atserias, V? Dalmau
Session 8
Memoization and DPLL: Formula Caching Proof SystemsFull-text access may be available. Sign in or learn about subscription options.pp. 248
by Paul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind
Invited Talk
Inapproximability Some history and some open problemsFull-text access may be available. Sign in or learn about subscription options.pp. 265
by Johan Hastad
Session 10
Holographic Proofs and DerandomizationFull-text access may be available. Sign in or learn about subscription options.pp. 269
Session 10
Three-Query PCPs with Perfect Completeness over non-Boolean DomainsFull-text access may be available. Sign in or learn about subscription options.pp. 284
by Lars Engebretsen, Jonas Holmerin
Session 10
List Decoding with Side InformationFull-text access may be available. Sign in or learn about subscription options.pp. 300
by Venkatesan Guruswami
Session 11
Disjoint NP-PairsFull-text access may be available. Sign in or learn about subscription options.pp. 313
by Christian Gla?er, Alan L. Selman, Samik Sengupta, Liyu Zhang
Session 11
Are Cook and Karp Ever the Same?Full-text access may be available. Sign in or learn about subscription options.pp. 333
by Richard Beigel, Lance Fortnow
Session 11
Universal Languages and the Power of DiagonalizationFull-text access may be available. Sign in or learn about subscription options.pp. 337
by Alan Nash, Russell Impagliazzo, Jeff Remmel
Session 11
Proving SAT does not have Small Circuits with an Application to the TwoFull-text access may be available. Sign in or learn about subscription options.pp. 347
by Lance Fortnow, A. Pavan, Samik Sengupta
Invited Talk
On Derandomizing Tests for Certain Polynomial IdentitiesFull-text access may be available. Sign in or learn about subscription options.pp. 355
by Manindra Agrawal
Session 13
Improved Inapproximability of Lattice and Coding Problems with PreprocessingFull-text access may be available. Sign in or learn about subscription options.pp. 363
by Oded Regev
Session 13
A Strong Inapproximability Gap for a Generalization of Minimum BisectionFull-text access may be available. Sign in or learn about subscription options.pp. 371
by Jonas Holmerin, Subhash Khot
Session 13
Vertex Cover Might be Hard to Approximate to within 2-\varepsilonFull-text access may be available. Sign in or learn about subscription options.pp. 379
by Subhash Khot, Oded Regev
Author Index
Author IndexFreely available from IEEE.pp. 387
Showing 40 out of 40