Abstract is missing.
- On Derandomizing Probabilistic Sublinear-Time AlgorithmsMarius Zimand. 1-9 [doi]
- The Communication Complexity of CorrelationPrahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan. 10-23 [doi]
- On Computation and Communication with Small BiasHarry Buhrman, Nikolai K. Vereshchagin, Ronald de Wolf. 24-32 [doi]
- Lower Bounds for Multi-Player Pointer JumpingAmit Chakrabarti. 33-45 [doi]
- Low-Depth Witnesses are Easy to FindLuis Antunes 0002, Lance Fortnow, Alexandre Pinto, Andre Souto. 46-51 [doi]
- Bounded Queries and the NP Machine HypothesisRichard Chang, Suresh Purini. 52-59 [doi]
- On C-Degrees, H-Degrees and T-DegreesWolfgang Merkle, Frank Stephan. 60-69 [doi]
- Time-Space Tradeoffs for Counting NP Solutions Modulo IntegersRyan Williams. 70-82 [doi]
- Halfspace MatricesAlexander A. Sherstov. 83-95 [doi]
- Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy CodesVenkatesan Guruswami, Christopher Umans, Salil P. Vadhan. 96-108 [doi]
- Perfect Parallel Repetition Theorem for Quantum XOR Proof SystemsRichard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay. 109-114 [doi]
- Quantum versus Classical Proofs and AdviceScott Aaronson, Greg Kuperberg. 115-128 [doi]
- Quantum t-designs: t-wise Independence in the Quantum WorldAndris Ambainis, Joseph Emerson. 129-140 [doi]
- Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty ProtocolsEmanuele Viola, Avi Wigderson. 141-154 [doi]
- On Approximate Majority and Probabilistic TimeEmanuele Viola. 155-168 [doi]
- An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy ComplexityKei Uchizawa, Eiji Takimoto. 169-178 [doi]
- Understanding Parallel Repetition Requires Understanding FoamsUriel Feige, Guy Kindler, Ryan O Donnell. 179-192 [doi]
- The Complexity of Polynomials and Their Coefficient FunctionsGuillaume Malod. 193-204 [doi]
- A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex CoverGrant Schoenebeck, Luca Trevisan, Madhur Tulsiani. 205-216 [doi]
- Directed Planar Reachability is in Unambiguous Log-SpaceChris Bourke, Raghunath Tewari, N. V. Vinodchandran. 217-221 [doi]
- Parity Problems in Planar GraphsMark Braverman, Raghav Kulkarni, Sambuddha Roy. 222-235 [doi]
- S-T Connectivity on Digraphs with a Known Stationary DistributionKai-Min Chung, Omer Reingold, Salil P. Vadhan. 236-249 [doi]
- On Parameterized Path and Chordless Path ProblemsYijia Chen, Jörg Flum. 250-263 [doi]
- Testing Properties of Constraint-GraphsShirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur. 264-277 [doi]
- Efficient Arguments without Short PCPsYuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky. 278-291 [doi]
- Bases Collapse in Holographic AlgorithmsJin-yi Cai, Pinyan Lu. 292-304 [doi]
- On the Theory of Matchgate ComputationsJin-yi Cai, Vinay Choudhary, Pinyan Lu. 305-318 [doi]
- A New Interactive Hashing TheoremIftach Haitner, Omer Reingold. 319-332 [doi]
- Limits on the Hardness of Lattice Problems in ell _p NormsChris Peikert. 333-346 [doi]
- On Heuristic Time HierarchiesKonstantin Pervyshev. 347-358 [doi]