Abstract is missing.
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Strong Locally Testable Codes with Relaxed Local DecodersOded Goldreich, Tom Gur, Ilan Komargodski. 1-41 [doi]
- An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All AlphabetsVenkatesan Guruswami, Ameya Velingker. 42-57 [doi]
- The List-Decoding Size of Fourier-Sparse Boolean FunctionsIshay Haviv, Oded Regev. 58-71 [doi]
- Nonclassical Polynomials as a Barrier to Polynomial Lower BoundsAbhishek Bhowmick 0001, Shachar Lovett. 72-87 [doi]
- Simplified Lower Bounds on the Multiparty Communication Complexity of DisjointnessAnup Rao, Amir Yehudayoff. 88-101 [doi]
- How to Compress Asymmetric CommunicationSivaramakrishnan Natarajan Ramamoorthy, Anup Rao. 102-123 [doi]
- Majority is Incompressible by AC^0[p] CircuitsIgor Carboni Oliveira, Rahul Santhanam. 124-157 [doi]
- Lower Bounds for Depth Three Arithmetic Circuits with Small Bottom FaninNeeraj Kayal, Chandan Saha. 158-208 [doi]
- A Depth-Five Lower Bound for Iterated Matrix MultiplicationSuman K. Bera, Amit Chakrabarti. 183-197 [doi]
- Factors of Low Individual Degree PolynomialsRafael Mendes de Oliveira. 198-216 [doi]
- Verifiable Stream Computation and Arthur-Merlin CommunicationAmit Chakrabarti, Graham Cormode, Andrew McGregor, Justin Thaler, Suresh Venkatasubramanian. 217-243 [doi]
- Identifying an Honest EXP^NP Oracle Among ManyShuichi Hirahara. 244-263 [doi]
- Adaptivity Helps for Testing JuntasRocco A. Servedio, Li-Yang Tan, John Wright. 264-279 [doi]
- A Characterization of Hard-to-cover CSPsAmey Bhangale, Prahladh Harsha, Girish Varma. 280-303 [doi]
- Subexponential Size Hitting Sets for Bounded Depth Multilinear FormulasRafael Mendes de Oliveira, Amir Shpilka, Ben lee Volk. 304-322 [doi]
- Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching ProgramsRohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf. 323-346 [doi]
- Kolmogorov Width of Discrete Linear Spaces: an Approach to Matrix RigidityAlex Samorodnitsky, Ilya D. Shkredov, Sergey Yekhanin. 347-364 [doi]
- On the (Non) NP-Hardness of Computing Circuit ComplexityCody D. Murray, Richard Ryan Williams. 365-380 [doi]
- Circuits with Medium Fan-InPavel Hrubes, Anup Rao. 381-391 [doi]
- Correlation Bounds Against Monotone NC^1Benjamin Rossman. 392-411 [doi]
- Non-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional ProofsFu Li, Iddo Tzameret, Zhengyu Wang. 412-432 [doi]
- The Space Complexity of Cutting Planes RefutationsNicola Galesi, Pavel Pudlák, Neil Thapen. 433-447 [doi]
- Tight Size-Degree Bounds for Sums-of-Squares ProofsMassimo Lauria, Jakob Nordström. 448-466 [doi]
- A Generalized Method for Proving Polynomial Calculus Degree Lower BoundsMladen Miksa, Jakob Nordström. 467-487 [doi]
- Generalized Quantum Arthur-Merlin GamesHirotada Kobayashi, François Le Gall, Harumichi Nishimura. 488-511 [doi]
- Parallel Repetition for Entangled k-player Games via Fast Quantum SearchKai-Min Chung, Xiaodi Wu, Henry S. Yuen. 512-536 [doi]
- Upper Bounds on Quantum Query Complexity Inspired by the Elitzur-Vaidman Bomb TesterCedric Yen-Yu Lin, Han-Hsuan Lin. 537-566 [doi]
- A Polylogarithmic PRG for Degree 2 Threshold Functions in the Gaussian SettingDaniel M. Kane. 567-581 [doi]
- Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (Extended Abstract)Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang. 582-600 [doi]
- On Randomness Extraction in AC0Oded Goldreich, Emanuele Viola, Avi Wigderson. 601-668 [doi]