Abstract is missing.
- Complete Derandomization of Identity Testing and Reconstruction of Read-Once FormulasDaniel Minahan, Ilya Volkovich. [doi]
- Optimal Quantum Sample Complexity of Learning AlgorithmsSrinivasan Arunachalam, Ronald de Wolf. [doi]
- Bounded Independence Plus Noise Fools ProductsElad Haramaty, Chin Ho Lee, Emanuele Viola. [doi]
- Augmented Index and Quantum Streaming Algorithms for DYCK(2)Ashwin Nayak, Dave Touchette. [doi]
- Reconstruction of Full Rank Algebraic Branching ProgramsNeeraj Kayal, Vineet Nair, Chandan Saha 0001, Sébastien Tavenas. [doi]
- Noise Stability Is Computable and Approximately Low-DimensionalAnindya De, Elchanan Mossel, Joe Neeman. [doi]
- Front Matter, Table of Contents, Preface, Awards, Conference Organization, External Reviewers [doi]
- Distribution Testing Lower Bounds via Reductions from Communication ComplexityEric Blais, Clément L. Canonne, Tom Gur. [doi]
- Complexity-Theoretic Foundations of Quantum Supremacy ExperimentsScott Aaronson, Lijie Chen. [doi]
- Tight Bounds on the Fourier Spectrum of AC0Avishay Tal. [doi]
- A Quadratic Lower Bound for Homogeneous Algebraic Branching ProgramsMrinal Kumar. [doi]
- Derandomizing Isolation in Space-Bounded SettingsDieter van Melkebeek, Gautam Prakriya. [doi]
- Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and PolynomialsRoei Tell. [doi]
- PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT FasterDominik Scheder, John P. Steinberger. [doi]
- Conspiracies Between Learning Algorithms, Circuit Lower Bounds, and PseudorandomnessIgor Carboni Oliveira, Rahul Santhanam. [doi]
- An Adaptivity Hierarchy Theorem for Property TestingClément L. Canonne, Tom Gur. [doi]
- Trading Information Complexity for ErrorYuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li. [doi]
- A Note on Amortized Branching Program ComplexityAaron Potechin. [doi]
- On the Polynomial Parity Argument Complexity of the Combinatorial NullstellensatzAleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang. [doi]
- From Weak to Strong LP Gaps for All CSPsMrinal Kanti Ghosh, Madhur Tulsiani. [doi]
- Query-to-Communication Lifting for P^NPMika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson 0001. [doi]
- An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite FieldsMrinal Kumar 0001, Ramprasad Saptharishi. [doi]
- Representations of Monotone Boolean Functions by Linear ProgramsMateus de Oliveira Oliveira, Pavel Pudlák. [doi]
- Easiness Amplification and Uniform Circuit Lower BoundsCody D. Murray, R. Ryan Williams. [doi]
- The Computational Complexity of Integer Programming with AlternationsDanny Nguyen, Igor Pak. [doi]
- Separating Quantum Communication and Approximate RankAnurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain 0001, Robin Kothari, Troy Lee. [doi]
- Exponentially Small Soundness for the Direct Product Z-TestIrit Dinur, Inbal Livni Navon. [doi]
- Stochasticity in Algorithmic Statistics for Polynomial TimeAlexey Milovanov, Nikolay K. Vereshchagin. [doi]
- Settling the Query Complexity of Non-Adaptive Junta TestingXi Chen 0001, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie. [doi]
- Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix SpacesMarkus Bläser, Gorav Jindal, Anurag Pandey. [doi]
- Random Resolution RefutationsPavel Pudlák, Neil Thapen. [doi]
- On the Average-Case Complexity of MCSP and Its VariantsShuichi Hirahara, Rahul Santhanam. [doi]
- Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner BasesMassimo Lauria, Jakob Nordström. [doi]
- On Algebraic Branching Programs of Small WidthKarl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam. [doi]