Abstract is missing.
- Front Matter, Table of Contents, Preface, Awards, Conference Organization, External Reviewers [doi]
- Complexity Classification of Two-Qubit Commuting HamiltoniansAdam Bouland, Laura Mancinska, Xue Zhang. [doi]
- Learning Algorithms from Natural ProofsMarco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova. [doi]
- Decoding Reed-Muller Codes Over Product SetsJohn Y. Kim, Swastik Kopparty. [doi]
- Nearly Optimal Separations Between Communication (or Query) Complexity and PartitionsAndris Ambainis, Martins Kokainis, Robin Kothari. [doi]
- Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching ProgramsMatthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben lee Volk. [doi]
- Polynomial Bounds for Decoupling, with ApplicationsRyan O'Donnell, Yu Zhao. [doi]
- Non-Malleable Extractors - New Tools and Improved ConstructionsGil Cohen. [doi]
- Tight SoS-Degree Bounds for Approximate Nash EquilibriaAram Wettroth Harrow, Anand Natarajan, Xiaodi Wu. [doi]
- Arithmetic Circuits with Locally Low Algebraic RankMrinal Kumar 0001, Shubhangi Saraf. [doi]
- Lower Bounds for Constant Query Affine-Invariant LCCs and LTCsArnab Bhattacharyya, Sivakanth Gopi. [doi]
- On the Sum-of-Squares Degree of Symmetric Quadratic FunctionsTroy Lee, Anupam Prakash, Ronald de Wolf, Henry Yuen. [doi]
- Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch EvaluationRichard Ryan Williams. [doi]
- Limits of Minimum Circuit Size Problem as OracleShuichi Hirahara, Osamu Watanabe. [doi]
- A Linear Time Algorithm for Quantum 2-SATJ. Niel de Beaudrap, Sevag Gharibian. [doi]
- Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication ComplexityIrit Dinur, Or Meir. [doi]
- New Characterizations in Turnstile Streams with ApplicationsYuqing Ai, Wei Hu, Yi Li, David P. Woodruff. [doi]
- Sums of Products of Polynomials in Few Variables: Lower Bounds and Polynomial Identity TestingMrinal Kumar 0001, Shubhangi Saraf. [doi]
- Tight Bounds for Communication-Assisted Agreement DistillationVenkatesan Guruswami, Jaikumar Radhakrishnan. [doi]
- Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold CircuitsRuiwen Chen, Rahul Santhanam, Srikanth Srinivasan. [doi]
- Polynomials, Quantum Query Complexity, and Grothendieck's InequalityScott Aaronson, Andris Ambainis, Janis Iraids, Martins Kokainis, Juris Smotrovs. [doi]
- Identity Testing for Constant-Width, and Commutative, Read-Once Oblivious ABPsRohit Gurjar, Arpita Korwar, Nitin Saxena. [doi]
- New Extractors for Interleaved SourcesEshan Chattopadhyay, David Zuckerman. [doi]
- New Non-Uniform Lower Bounds for Uniform ClassesLance Fortnow, Rahul Santhanam. [doi]
- Sculpting Quantum SpeedupsScott Aaronson, Shalev Ben-David. [doi]
- Proof Complexity Lower Bounds from Algebraic Circuit ComplexityMichael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson. [doi]
- Understanding PPA-CompletenessXiaotie Deng, Jack R. Edmonds, Zhe Feng, Zhengyang Liu, Qi Qi, Zeying Xu. [doi]
- Evolution and Computation (Invited Talk)Nisheeth K. Vishnoi. [doi]
- Harmonicity and Invariance on Slices of the Boolean CubeYuval Filmus, Elchanan Mossel. [doi]
- A Composition Theorem for Conical JuntasMika Göös, T. S. Jayram. [doi]
- Invariance Principle on the SliceYuval Filmus, Guy Kindler, Elchanan Mossel, Karl Wimmer. [doi]
- New Hardness Results for Graph and Hypergraph ColoringsJoshua Brakensiek, Venkatesan Guruswami. [doi]
- Degree and Sensitivity: Tails of Two DistributionsParikshit Gopalan, Rocco A. Servedio, Avi Wigderson. [doi]
- Reconstruction of Real Depth-3 Circuits with Top Fan-In 2Gaurav Sinha. [doi]
- Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit ComplexityMichael A. Forbes, Mrinal Kumar, Ramprasad Saptharishi. [doi]
- Pseudorandomness When the Odds are Against YouSergei Artemenko, Russell Impagliazzo, Valentine Kabanets, Ronen Shaltiel. [doi]