Abstract is missing.
- 0 CircuitsMark Braverman. 3-8 [doi]
- k-Subgraph Isomorphism on AC::0:: CircuitsKazuyuki Amano. 9-18 [doi]
- Fixed-Polynomial Size Circuit BoundsLance Fortnow, Rahul Santhanam, Ryan Williams. 19-26 [doi]
- A New Characterization of ACC:::0::: and Probabilistic CC:::0:::Kristoffer Arnsfelt Hansen, Michal Koucký. 27-34 [doi]
- A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the PermanentPascal Koiran, Sylvain Perifel. 35-40 [doi]
- The Proof Complexity of Polynomial IdentitiesPavel Hrubes, Iddo Tzameret. 41-51 [doi]
- Locally Testable Codes Require Redundant TestersEli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman. 52-61 [doi]
- Every Permutation CSP of arity 3 is Approximation ResistantMoses Charikar, Venkatesan Guruswami, Rajsekar Manokaran. 62-73 [doi]
- Inapproximability of Vertex Cover and Independent Set in Bounded Degree GraphsPer Austrin, Subhash Khot, Muli Safra. 74-80 [doi]
- Are PCPs Inherent in Efficient Arguments?Guy N. Rothblum, Salil P. Vadhan. 81-92 [doi]
- Extractors for Low-Weight Affine SourcesAnup Rao. 95-101 [doi]
- Extractors for VarietiesZeev Dvir. 102-113 [doi]
- Weak Derandomization of Weak Algorithms: Explicit Versions of Yao s LemmaRonen Shaltiel. 114-125 [doi]
- Regularity, Boosting, and Efficiently Simulating Every High-Entropy DistributionLuca Trevisan, Madhur Tulsiani, Salil P. Vadhan. 126-136 [doi]
- An Almost Optimal Rank Bound for Depth-3 IdentitiesNitin Saxena, C. Seshadhri. 137-148 [doi]
- Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space CompleteAkitoshi Kawamura. 149-160 [doi]
- Improved Approximation of Linear Threshold FunctionsIlias Diakonikolas, Rocco A. Servedio. 161-172 [doi]
- On the Complexity of Boolean Functions in Different CharacteristicsParikshit Gopalan, Shachar Lovett, Amir Shpilka. 173-183 [doi]
- The Complexity of the Annihilating PolynomialNeeraj Kayal. 184-193 [doi]
- One-Way Functions and the Berman-Hartmanis ConjectureManindra Agrawal, Osamu Watanabe. 194-202 [doi]
- Planar Graph Isomorphism is in Log-SpaceSamir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner. 203-214 [doi]
- Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal StrategiesTsuyoshi Ito, Hirotada Kobayashi, Keiji Matsumoto. 217-228 [doi]
- Quantum Copy-Protection and Quantum MoneyScott Aaronson. 229-242 [doi]
- Parallel Approximation of Non-interactive Zero-sum Quantum GamesRahul Jain, John Watrous. 243-253 [doi]
- Lower Bounds on Quantum Multiparty Communication ComplexityTroy Lee, Gideon Schechtman, Adi Shraibman. 254-262 [doi]
- Increasing the Gap between Descriptional Complexity and Algorithmic ProbabilityAdam R. Day. 263-273 [doi]
- Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-inZohar Shay Karnin, Amir Shpilka. 274-285 [doi]
- Multitask Efficiencies in the Decision Tree ModelAndrew Drucker. 286-297 [doi]
- Worst-Case Running Times for Average-Case AlgorithmsLuis Filipe Coelho Antunes, Lance Fortnow. 298-303 [doi]
- On Basing ZK ≠ BPP on the Hardness of PAC LearningDavid Xiao. 304-315 [doi]
- Infinite vs. Finite Space-Bounded Randomized ComputationsRichard Královic. 316-325 [doi]
- On the Communication Complexity of Read-Once AC^0 FormulaeT. S. Jayram, Swastik Kopparty, Prasad Raghavendra. 329-340 [doi]
- Lower Bounds on the Randomized Communication Complexity of Read-Once FunctionsNikos Leonardos, Michael Saks. 341-350 [doi]
- An Approximation Algorithm for Approximation RankTroy Lee, Adi Shraibman. 351-357 [doi]
- A Multi-Round Communication Lower Bound for Gap Hamming and Some ConsequencesJoshua Brody, Amit Chakrabarti. 358-368 [doi]
- New Results in the Simultaneous Message Passing Model via Information Theoretic TechniquesRahul Jain, Hartmut Klauck. 369-378 [doi]
- The Maximum Communication Complexity of Multi-Party Pointer JumpingJoshua Brody. 379-386 [doi]