Abstract is missing.
- Average-Case Quantum Advantage with Shallow CircuitsFrançois Le Gall. [doi]
- Universality of EPR Pairs in Entanglement-Assisted Communication Complexity, and the Communication Cost of State ConversionMatthew Coudron, Aram Wettroth Harrow. [doi]
- Almost Optimal Distribution-Free Junta TestingNader H. Bshouty. [doi]
- Fourier and Circulant Matrices Are Not RigidZeev Dvir, Allen Liu. [doi]
- Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High PrecisionMatthew Coudron, William Slofstra. [doi]
- Limits on the Universal Method for Matrix MultiplicationJosh Alman. [doi]
- A Time-Distance Trade-Off for GDD with Preprocessing - Instantiating the DLW HeuristicNoah Stephens-Davidowitz. [doi]
- Parity Helps to Compute MajorityIgor Carboni Oliveira, Rahul Santhanam, Srikanth Srinivasan 0001. [doi]
- Optimal Separation and Strong Direct Sum for Randomized Query ComplexityEric Blais, Joshua Brody. [doi]
- Hardness Magnification near State-Of-The-Art Lower BoundsIgor Carboni Oliveira, Ján Pich, Rahul Santhanam. [doi]
- Resolution and the Binary Encoding of Combinatorial PrinciplesStefan S. Dantchev, Nicola Galesi, Barnaby Martin. [doi]
- Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton TheoremsLijie Chen, Dylan M. McKay, Cody D. Murray, R. Ryan Williams. [doi]
- Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and p-Adic ApplicationsAshish Dwivedi, Rajat Mittal, Nitin Saxena 0001. [doi]
- Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once FormulasDean Doron, Pooya Hatami, William M. Hoza. [doi]
- Typically-Correct Derandomization for Small Time and SpaceWilliam M. Hoza. [doi]
- UG-Hardness to NP-Hardness by Losing HalfAmey Bhangale, Subhash Khot. [doi]
- Fourier Bounds and Pseudorandom Generators for Product TestsChin Ho Lee. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz ProofsAlbert Atserias, Tuomas Hakoniemi. [doi]
- Optimality of Linear Sketching Under Modular UpdatesKaave Hosseini, Shachar Lovett, Grigory Yaroslavtsev. [doi]
- Nullstellensatz Size-Degree Trade-offs from Reversible PebblingSusanna F. de Rezende, Jakob Nordström, Or Meir, Robert Robere. [doi]
- Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal ConstructionsXin Li. [doi]
- Stronger Connections Between Circuit Analysis and Circuit Lower Bounds, via PCPs of ProximityLijie Chen, R. Ryan Williams. [doi]
- Equality Alone Does not Simulate RandomnessArkadev Chattopadhyay, Shachar Lovett, Marc Vinyals. [doi]
- Time-Space Lower Bounds for Two-Pass LearningSumegha Garg, Ran Raz, Avishay Tal. [doi]
- Imperfect Gaps in Gap-ETH and PCPsMitali Bafna, Nikhil Vyas 0001. [doi]
- Optimal Short-Circuit Resilient FormulasMark Braverman, Klim Efremenko, Ran Gelles, Michael A. Yitayew. [doi]
- Sherali - Adams Strikes BackRyan O'Donnell, Tselil Schramm. [doi]
- From DNF Compression to Sunflower Theorems via RegularityShachar Lovett, Noam Solomon, Jiapeng Zhang. [doi]
- A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph PropertiesKarl Bringmann, Nick Fischer, Marvin Künnemann. [doi]
- Criticality of Regular FormulasBenjamin Rossman. [doi]
- Simple and Efficient Pseudorandom Generators from Gaussian ProcessesEshan Chattopadhyay, Anindya De, Rocco A. Servedio. [doi]
- Barriers for Fast Matrix Multiplication from IrreversibilityMatthias Christandl, Péter Vrana, Jeroen Zuiddam. [doi]