List of accepted papers for CCC 2003: Quantum Certificate Complexity Scott Aaronson Derandomization and Distinguishing Complexity. Eric Allender, Michal Koucky, Detlef Ronneburger, Sambuddha Roy. Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness Amit Chakrabarti and Subhash Khot and Xiaodong Sun Uniform Hardness vs. Randomness Tradeoffs for Arthur-Merlin Games Dan Gutreund and Ronen Shaltiel and Amnon Ta-Shma Universal Languages and the Power of Diagonalization Alan Nash and Russell Impagliazzo and Jeff Remmel Extracting the Mutual Information for a Triple of Binary Strings Andrei E. Romashchenko A Combinatorial Characterization of Resolution Width Albert Atserias and Victor Dalmau Quantum decision trees and semidefinite programming Howard Barnum and Michael Saks and Mario Szegedy Memoization and DPLL: Formula Caching Proof Systems Paul Beame and Russell Impagliazzo and Toniann Pitassi and Nathan Segerlind Three-Query PCPs with Perfect Completeness over non-Boolean Domains Lars Engebretsen and Jonas Holmerin Are Cook and Karp Ever the Same? Richard Beigel and Lance Fortnow Disjoint NP-Pairs Christian Glaßr and Alan L. Selman and Samik Sengupta and Liyu Zhang Bounded Nondeterminism and Alternation in Parameterized Complexity Theory Yijia Chen and Joerg Flum and Martin Grohe A Strong Inapproximability Result for a Generalization of Minimum Bisection. Jonas Holmerin and Subhash Khot The complexity of Unique k-SAT: An isolation lemma for k-CNFs Chris Calabro and Russell Impagliazzo and Valentine Kabanets and Ramamohan Paturi Rectangle Size Bounds and Threshold Covers in Communication Complexity Hartmut Klauck The complexity of stochastic sequences Wolfgang Merkle A zero-one law for RP Russell Impagliazzo and Philippe Moser Improved Inapproximability of Lattice and Coding Problems with Preprocessing Oded Regev Vertex Cover Might be Hard to Approximate to within 2-e Subhash Khot and Oded Regev Extremal properties of polynomial threshold functions Ryan O'Donnell and Rocco Servedio Proving SAT does not have Small Circuits with an Application to the Two Queries Problem Lance Fortnow and A. Pavan and Samik Sengupta Lower bounds for predecessor searching in the cell probe model Pranab Sen Holographic Proofs and Derandomization Rahul Santhanam and Dieter van Melkebeek Minimization of Decision Trees is Hard to Approximate Detlef Sieling Optimal Separation of EROW and CROW PRAMs Navin Goyal and Michael Saks and S. Venkatesh List decoding with side information Venkatesan Guruswami Hardness vs. Randomness within Uniform AC0 Emanuele Viola On Statistical Query Sampling and NMR Quantum Computing Avrim Blum and Ke Yang