Abstract is missing.
- Extremal properties of polynomial threshold functions3-12 [doi]
- Bounded Nondeterminism and Alternation in Parameterized Complexity TheoryYijia Chen, Jörg Flum, Martin Grohe. 13-29 [doi]
- Uniform hardness vs. randomness tradeoffs for Arthur-Merlin gamesDan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma. 33-47 [doi]
- A zero one law for RPRussell Impagliazzo, Philippe Moser. 48-52 [doi]
- Hardness vs. Randomness within Alternating TimeEmanuele Viola. 53 [doi]
- Lower bounds for predecessor searching in the cell probe modelPranab Sen. 73-83 [doi]
- Minimization of Decision Trees Is Hard to ApproximateDetlef Sieling. 84-92 [doi]
- Optimal Separation of EROW and CROWPRAMsNavin Goyal, Michael E. Saks, Srinivasan Venkatesh. 93 [doi]
- Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set DisjointnessAmit Chakrabarti, Subhash Khot, Xiaodong Sun. 107-117 [doi]
- Rectangle Size Bounds and Threshold Covers in Communication ComplexityHartmut Klauck. 118-134 [doi]
- The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFsChris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi. 135 [doi]
- Quantum Certificate ComplexityScott Aaronson. 171-178 [doi]
- Quantum query complexity and semi-definite programmingHoward Barnum, Michael E. Saks, Mario Szegedy. 179-193 [doi]
- On Statistical Query Sampling and NMR Quantum ComputingKe Yang, Avrim Blum. 194 [doi]
- Derandomization and Distinguishing ComplexityEric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy. 209-220 [doi]
- Extracting the Mutual Information for a Triple of Binary StringsAndrei E. Romashchenko. 221-229 [doi]
- The complexity of stochastic sequencesWolfgang Merkle. 230 [doi]
- A Combinatorial Characterization of ResolutionWidthAlbert Atserias, Víctor Dalmau. 239-247 [doi]
- Memoization and DPLL: Formula Caching Proof SystemsPaul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind. 248 [doi]
- Inapproximability Some history and some open problemsJohan Håstad. 265 [doi]
- Holographic Proofs and DerandomizationRahul Santhanam, Dieter van Melkebeek. 269-283 [doi]
- Three-Query PCPs with Perfect Completeness over non-Boolean DomainsLars Engebretsen, Jonas Holmerin. 284-299 [doi]
- List Decoding with Side InformationVenkatesan Guruswami. 300 [doi]
- Disjoint NP-PairsChristian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang. 313-332 [doi]
- Are Cook and Karp Ever the Same?Richard Beigel, Lance Fortnow. 333-336 [doi]
- Universal Languages and the Power of DiagonalizationAlan Nash, Russell Impagliazzo, Jeffrey B. Remmel. 337-346 [doi]
- Proving SAT does not have Small Circuits with an Application to the TwoLance Fortnow, Aduri Pavan, Samik Sengupta. 347 [doi]
- On Derandomizing Tests for Certain Polynomial IdentitiesManindra Agrawal. 355 [doi]
- Improved Inapproximability of Lattice and Coding Problems with PreprocessingOded Regev. 363-370 [doi]
- A Strong Inapproximability Gap for a Generalization of Minimum BisectionJonas Holmerin, Subhash Khot. 371-378 [doi]
- Vertex Cover Might be Hard to Approximate to within 2-/varepsilonSubhash Khot, Oded Regev. 379 [doi]