Table of Contents

• Linear-Size Boolean Circuits for MultiselectionJustin Holmgren, Ron Rothblum. [doi]
• On the Degree of Polynomials Computing Square Roots Mod pKiran S. Kedlaya, Swastik Kopparty. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Failure of Feasible Disjunction Property for k-DNF Resolution and NP-Hardness of Automating ItMichal Garlík. [doi]
• Gap MCSP Is Not (Levin) NP-Complete in ObfustopiaNoam Mazor, Rafael Pass. [doi]
• A Strong Direct Sum Theorem for Distributional Query ComplexityGuy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan. [doi]
• Finer-Grained Hardness of Kernel Density EstimationJosh Alman, Yunfeng Guan. [doi]
• Lifting DichotomiesYaroslav Alekseev, Yuval Filmus, Alexander Smal. [doi]
• BPL ⊆ L-AC¹Kuan Cheng, Yichuan Wang. [doi]
• Low-Depth Algebraic Circuit Lower Bounds over Any FieldMichael A. Forbes 0001. [doi]
• Exact Search-To-Decision Reductions for Time-Bounded Kolmogorov ComplexityShuichi Hirahara, Valentine Kabanets, Zhenjian Lu, Igor C. Oliveira. [doi]
• Exponential Separation Between Powers of Regular and General Resolution over ParitiesSreejata Kishor Bhattacharya, Arkadev Chattopadhyay, Pavel Dvorák. [doi]
• Public-Key Pseudoentanglement and the Hardness of Learning Ground State Entanglement StructureAdam Bouland, Bill Fefferman, Soumik Ghosh, Tony Metger, Umesh V. Vazirani, Chenyi Zhang, Zixin Zhou. [doi]
• Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and DegeneracySepehr Assadi, Prantar Ghosh, Bruno Loff, Parth Mittal, Sagnik Mukhopadhyay. [doi]
• Dimension Independent Disentanglers from Unentanglement and ApplicationsFernando Granha Jeronimo, Pei Wu. [doi]
• Information Dissemination via Broadcasts in the Presence of Adversarial NoiseKlim Efremenko, Gillat Kol, Dmitry Paramonov, Ran Raz, Raghuvansh R. Saxena. [doi]
• Lower Bounds for Set-Multilinear Branching ProgramsPrerona Chatterjee, Deepanshu Kush, Shubhangi Saraf, Amir Shpilka. [doi]
• Finding Missing Items Requires Strong Forms of RandomnessAmit Chakrabarti, Manuel Stoeckl. [doi]
• Baby PIH: Parameterized Inapproximability of Min CSPVenkatesan Guruswami, Xuandi Ren, Sai Sandeep. [doi]
• Quantum Automating TC⁰-Frege Is LWE-HardNoel Arteche, Gaia Carenini, Matthew Gray. [doi]
• Local Enumeration and Majority Lower BoundsMohit Gurumukhani, Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Navid Talebanfard. [doi]
• A Technique for Hardness Amplification Against AC⁰William M. Hoza. [doi]
• The Entangled Quantum Polynomial Hierarchy CollapsesSabee Grewal, Justin Yirka. [doi]
• Explicit Time and Space Efficient Encoders Exist Only with Random AccessJoshua Cook, Dana Moshkovitz. [doi]
• A Subquadratic Upper Bound on Sum-Of-Squares Composition FormulasPavel Hrubes. [doi]
• Search-To-Decision Reductions for Kolmogorov ComplexityNoam Mazor, Rafael Pass. [doi]
• Derandomizing Logspace with a Small Shared Hard DriveEdward Pyne. [doi]
• Depth-d Frege Systems Are Not Automatable Unless P = NPTheodoros Papamakarios. [doi]
• Asymptotically-Good RLCCs with (log n)^(2+o(1)) QueriesGil Cohen, Tal Yankovitz. [doi]
• Solving Unique Games over Globally Hypercontractive GraphsMitali Bafna, Dor Minzer. [doi]
• Distribution-Free Proofs of ProximityHugo Aaronson, Tom Gur, Ninad Rajgopal, Ron D. Rothblum. [doi]
• Streaming Zero-Knowledge ProofsGraham Cormode, Marcel Dall'Agnol, Tom Gur, Chris Hickey. [doi]
• Complexity of Robust Orbit Problems for Torus Actions and the abc-ConjecturePeter Bürgisser, Mahmut Levent Dogan, Visu Makam, Michael Walter 0005, Avi Wigderson. [doi]
• Explicit Directional Affine Extractors and Improved Hardness for Linear Branching ProgramsXin Li 0006, Yan Zhong 0002. [doi]
• The Computational Advantage of MIP^∗ Vanishes in the Presence of NoiseYangjing Dong, Honghao Fu, Anand Natarajan, Minglong Qin, Haochen Xu, Penghui Yao. [doi]
• Pseudorandomness, Symmetry, Smoothing: IHarm Derksen, Peter Ivanov, Chin Ho Lee, Emanuele Viola. [doi]
• Hard Submatrices for Non-Negative Rank and Communication ComplexityPavel Hrubes. [doi]