Table of Contents

• On the Complexity of Modulo-q Arguments and the Chevalley - Warning TheoremMika Göös, Pritish Kamath, Katerina Sotiraki, Manolis Zampetakis. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• NP-Hardness of Circuit Minimization for Multi-Output FunctionsRahul Ilango, Bruno Loff, Igor Carboni Oliveira. [doi]
• Circuit Lower Bounds from NP-Hardness of MCSP Under Turing ReductionsMichael Saks, Rahul Santhanam. [doi]
• Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse GraphsSusanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov 0001. [doi]
• Near-Optimal Erasure List-Decodable CodesAvraham Ben-Aroya, Dean Doron, Amnon Ta-Shma. [doi]
• A Generalized Sylvester-Gallai Type Theorem for Quadratic PolynomialsShir Peleg, Amir Shpilka. [doi]
• Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint SatisfactionMarvin Künnemann, Dániel Marx. [doi]
• Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom Generator ConstructionsShuichi Hirahara. [doi]
• Simultaneous Max-Cut Is Harder to Approximate Than Max-CutAmey Bhangale, Subhash Khot. [doi]
• Hitting Sets Give Two-Sided Derandomization of Small SpaceKuan Cheng, William M. Hoza. [doi]
• Palette-Alternating Tree CodesGil Cohen, Shahar Samocha. [doi]
• Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph StreamsJacques Dark, Christian Konrad. [doi]
• Super Strong ETH Is True for PPSZ with Small Resolution WidthDominik Scheder, Navid Talebanfard. [doi]
• Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value ProblemsLaurent Bartholdi, Michael Figelius, Markus Lohrey, Armin Weiß. [doi]
• On the Quantum Complexity of Closest Pair and Related ProblemsScott Aaronson, Nai-Hui Chia, Han-Hsuan Lin, Chunhao Wang, Ruizhe Zhang. [doi]
• Lower Bounds for Matrix FactorizationMrinal Kumar 0001, Ben lee Volk. [doi]
• Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf GatesValentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor Oliveira. [doi]
• Connecting Perebor Conjectures: Towards a Search to Decision Reduction for Minimizing FormulasRahul Ilango. [doi]
• Quantum Lower Bounds for Approximate Counting via Laurent PolynomialsScott Aaronson, Robin Kothari, William Kretschmer, Justin Thaler. [doi]
• Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn'tPrasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan 0001. [doi]
• Statistical Physics Approaches to Unique GamesMatthew Coulson, Ewan Davies, Alexandra Kolla, Viresh Patel, Guus Regts. [doi]
• Geometric Rank of Tensors and Subrank of Matrix MultiplicationSwastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam. [doi]
• A Quadratic Lower Bound for Algebraic Branching ProgramsPrerona Chatterjee, Mrinal Kumar 0001, Adrian She, Ben lee Volk. [doi]
• On the Complexity of Branching ProofsDaniel Dadush, Samarth Tiwari. [doi]
• p NormsHuck Bennett, Chris Peikert. [doi]
• Algebraic Hardness Versus Randomness in Low CharacteristicRobert Andrews 0003. [doi]
• Optimal Error Pseudodistributions for Read-Once Branching ProgramsEshan Chattopadhyay, Jyun-Jie Liao. [doi]
• A Super-Quadratic Lower Bound for Depth Four Arithmetic CircuitsNikhil Gupta, Chandan Saha 0001, Bhargav Thankey. [doi]
• Limits of PreprocessingYuval Filmus, Yuval Ishai, Avi Kaplan, Guy Kindler. [doi]
• Log-Seed Pseudorandom Generators via Iterated RestrictionsDean Doron, Pooya Hatami, William M. Hoza. [doi]
• Sign Rank vs DiscrepancyHamed Hatami, Kaave Hosseini, Shachar Lovett. [doi]
• Multiparty Karchmer - Wigderson Games and Threshold CircuitsAlexander Kozachinskiy, Vladimir V. Podolskii. [doi]
• Approximability of the Eight-Vertex ModelJin-yi Cai, Tianyu Liu, Pinyan Lu, Jing Yu. [doi]
• Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant RingsAnkit Garg, Christian Ikenmeyer, Visu Makam, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson. [doi]
• Sum of Squares Bounds for the Ordering PrincipleAaron Potechin. [doi]
• Quantum Query-To-Communication Simulation Needs a Logarithmic OverheadSourav Chakraborty 0001, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar. [doi]
• Algebraic Branching Programs, Border Complexity, and Tangent SpacesMarkus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, Nitin Saurabh. [doi]
• Factorization of Polynomials Given By Arithmetic Branching ProgramsAmit Sinhababu, Thomas Thierauf. [doi]