Abstract is missing.
- NP-Hard Sets Are Exponentially Dense Unless coNP C NP/polyHarry Buhrman, John M. Hitchcock. 1-7 [doi]
- Approximation of Natural W[P]-Complete Minimisation Problems Is HardKord Eickmeyer, Martin Grohe, Magdalena Grüber. 8-18 [doi]
- Hardness Amplification within NP against Deterministic AlgorithmsParikshit Gopalan, Venkatesan Guruswami. 19-30 [doi]
- Amplifying Lower Bounds by Means of Self-ReducibilityEric Allender, Michal Koucký. 31-40 [doi]
- Amplifying ZPP^SAT[1] and the Two Queries ProblemRichard Chang, Suresh Purini. 41-52 [doi]
- Learning Complexity vs. Communication ComplexityNati Linial, Adi Shraibman. 53-63 [doi]
- Communication Complexity under Product and Nonproduct DistributionsAlexander A. Sherstov. 64-70 [doi]
- A Direct Product Theorem for DiscrepancyTroy Lee, Adi Shraibman, Robert Spalek. 71-80 [doi]
- Disjointness Is Hard in the Multi-party Number-on-the-Forehead ModelTroy Lee, Adi Shraibman. 81-91 [doi]
- Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial SizeKristoffer Arnsfelt Hansen. 92-99 [doi]
- On the Relative Efficiency of Resolution-Like Proofs and Ordered Binary Decision Diagram ProofsNathan Segerlind. 100-111 [doi]
- Approximate Inclusion-Exclusion for Arbitrary Symmetric FunctionsAlexander A. Sherstov. 112-123 [doi]
- The Sum of d Small-Bias Generators Fools Polynomials of Degree dEmanuele Viola. 124-127 [doi]
- Lower Bounds and Separations for Constant Depth Multilinear CircuitsRan Raz, Amir Yehudayoff. 128-139 [doi]
- Noisy Interpolating Sets for Low Degree PolynomialsZeev Dvir, Amir Shpilka. 140-148 [doi]
- Constraint Logic: A Uniform Framework for Modeling Computation as GamesErik D. Demaine, Robert A. Hearn. 149-162 [doi]
- Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased CodesVenkatesan Guruswami, Atri Rudra. 163-174 [doi]
- Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne NumbersKiran S. Kedlaya, Sergey Yekhanin. 175-186 [doi]
- Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof SystemsTsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, Andrew Chi-Chih Yao. 187-198 [doi]
- The Quantum Moment Problem and Bounds on Entangled Multi-prover GamesAndrew C. Doherty, Yeong-Cherng Liang, Ben Toner, Stephanie Wehner. 199-210 [doi]
- Using Entanglement in Quantum Multi-prover Interactive ProofsJulia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick. 211-222 [doi]
- The Power of UnentanglementScott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor. 223-236 [doi]
- The Multiplicative Quantum AdversaryRobert Spalek. 237-248 [doi]
- Approximation Resistant Predicates from Pairwise IndependencePer Austrin, Elchanan Mossel. 249-258 [doi]
- 2-Transitivity Is Insufficient for Local TestabilityElena Grigorescu, Tali Kaufman, Madhu Sudan. 259-267 [doi]
- New Results on Noncommutative and Commutative Polynomial Identity TestingVikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan. 268-279 [doi]
- Black Box Polynomial Identity Testing of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-InZohar Shay Karnin, Amir Shpilka. 280-291 [doi]
- Quantum Expanders: Motivation and ConstructionsAvraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma. 292-303 [doi]
- Towards Dimension Expanders over Finite FieldsZeev Dvir, Amir Shpilka. 304-310 [doi]
- Detecting Rational Points on Hypersurfaces over Finite FieldsSwastik Kopparty, Sergey Yekhanin. 311-320 [doi]
- Randomised Individual Communication ComplexityHarry Buhrman, Michal Koucký, Nikolai K. Vereshchagin. 321-331 [doi]
- Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication ComplexityDmitry Gavinsky, Pavel Pudlák. 332-339 [doi]