Abstract is missing.
- Committees [doi]
- Awards [doi]
- Preface [doi]
- Reviewers [doi]
- Godel and Computations (Abstract)Pavel Pudlák. 3-5 [doi]
- Polynomial Identity Testing for Depth 3 CircuitsNeeraj Kayal, Nitin Saxena. 9-17 [doi]
- Every Linear Threshold Function has a Low-Weight ApproximatorRocco A. Servedio. 18-32 [doi]
- Constructions of Low-Degree and Error-Correcting in-Biased GeneratorsAmir Shpilka. 33-45 [doi]
- How to Get More Mileage from Randomness ExtractorsRonen Shaltiel. 46-60 [doi]
- Exposure-Resilient ExtractorsMarius Zimand. 61-72 [doi]
- Making Hard Problems HarderJoshua Buresh-Oppenheim, Rahul Santhanam. 73-87 [doi]
- Distinguishing SAT from Polynomial-Size Circuits, through Black-Box QueriesAlbert Atserias. 88-95 [doi]
- Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-HardnessRafael Pass. 96-110 [doi]
- Applications of the Sum-Product Theorem in Finite FieldsAvi Wigderson. 111 [doi]
- Constructing Ramsey Graphs from Boolean Function RepresentationsParikshit Gopalan. 115-128 [doi]
- A Generic Time Hierarchy for Semantic Models with One Bit of AdviceDieter van Melkebeek, Konstantin Pervyshev. 129-144 [doi]
- Hardness of the Covering Radius Problem on LatticesIshay Haviv, Oded Regev. 145-158 [doi]
- A 3-Query Non-Adaptive PCP with Perfect CompletenessSubhash Khot, Rishi Saket. 159-169 [doi]
- New Lower Bounds for Vertex Cover in the Lovasz-Schrijver HierarchyIannis Tourlakis. 170-182 [doi]
- FO[<]-UniformityChristoph Behle, Klaus-Jörn Lange. 183-189 [doi]
- Circuit Lower Bounds via Ehrenfeucht-Fraisse GamesMichal Koucký, Clemens Lautemann, Sebastian Poloczek, Denis Thérien. 190-201 [doi]
- On Modular Counting with PolynomialsKristoffer Arnsfelt Hansen. 202-212 [doi]
- Learning Monotone Decision Trees in Polynomial TimeRyan O Donnell, Rocco A. Servedio. 213-225 [doi]
- Optimal Hardness Results for Maximizing Agreements with MonomialsVitaly Feldman. 226-236 [doi]
- Minimizing DNF Formulas and AC:::0:::::d:: Circuits Given a Truth TableEric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks. 237-251 [doi]
- A Duality between Clause Width and Clause Density for SATChris Calabro, Russell Impagliazzo, Ramamohan Paturi. 252-260 [doi]
- QMA/qpoly /subseteq PSPACE/poly: De-Merlinizing Quantum ProtocolsScott Aaronson. 261-273 [doi]
- Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup ProblemPranab Sen. 274-287 [doi]
- Strengths and Weaknesses of Quantum FingerprintingDmitry Gavinsky, Julia Kempe, Ronald de Wolf. 288-298 [doi]
- Grid Graph Reachability ProblemsEric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy. 299-313 [doi]
- An Isomorphism between Subexponential and Parameterized Complexity TheoryYijia Chen, Martin Grohe. 314-330 [doi]
- On the Complexity of Numerical AnalysisEric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen. 331-339 [doi]
- Oracles Are Subtle But Not MaliciousScott Aaronson. 340-354 [doi]
- Derandomization of Probabilistic Auxiliary Pushdown Automata ClassesH. Venkateswaran. 355-370 [doi]