Table of Contents

• Trace Hermitian Codes Have Vanishing BiasSwastik Kopparty, Amnon Ta-Shma, Kedem Yakirevitch. [doi]
• Bounds for Hardness Condensation in the Query ModelChandrima Kayal, Rajat Mittal 0001, Sai Soumya Nalli, Manaswi Paraashar, Karthikeya Polisetty, Jayalal Sarma, Nitin Saurabh. [doi]
• Frontier Space-Time Algorithms Using Only Full MemoryPetr Chmel, Aditi Dudeja, Michal Koucký 0001, Ian Mertz, Ninad Rajgopal. [doi]
• Efficient AdversariesErfan Khaniki, Ján Pich, Dmitry Sokolov 0001. [doi]
• On Factorization of Sparse Polynomials of Bounded Individual DegreeAminadav Chuyoon, Amir Shpilka. [doi]
• Separations Above TFNP from Sherali-Adams Lower BoundsNoah Fleming, Anna Gál, Deniz imrek, Christophe Marciot. [doi]
• The Log-Rank Conjecture: New Equivalent FormulationsLianna Hambardzumyan, Shachar Lovett, Morgan Shirley. [doi]
• ETH-Hardness of Learning Monotone Circuits and Approximating Their SizeBruno Cavalar, Susanna F. de Rezende, Matthew Gray, Rahul Santhanam. [doi]
• Improved Bounds on the Space Complexity of Circuit EvaluationYakov Shalunov. [doi]
• Derandomised Tensor Product Gap Amplification for Quantum HamiltoniansThiago Bergamaschi, Tony Metger, Thomas Vidick, Tina Zhang. [doi]
• Optimal Testing of Reed-Muller Codes with an Online AdversaryEsty Kelman, Uri Meir, Kai Zhe Zheng. [doi]
• Hardness of Computing Nondeterministic Kolmogorov ComplexityJinqiao Hu, Zhenjian Lu, Igor C. Oliveira 0001. [doi]
• Wide Replacement Products Meet Gray Codes: Toward Optimal Small-Bias SetsGil Cohen, Itay Cohen 0003. [doi]
• Multilinear Formula Lower Bounds for Sparse DeterminantsPruthvi Boyapati, Suryajith Chillara, Pratyush Vempati. [doi]
• The Rate-Immediacy Barrier in Explicit Tree Code ConstructionsGil Cohen, Leonard J. Schulman, Piyush Srivastava 0001. [doi]
• Rank Bounds and Polynomial-Time PIT for Σ^k Π Σ Π² CircuitsAbhibhav Garg, Rafael Oliveira 0002, Akash Kumar Sengupta, Nir Shalmon, Amir Shpilka. [doi]
• Randomized Separations in Black-Box TFNPFedor Kiselev. [doi]
• Multilinear Algebraic Branching Programs and the Min-Partition Rank MethodThéo Borém Fabris, Nutan Limaye, Srikanth Srinivasan 0001, Amir Yehudayoff. [doi]
• Improved Parallel Repetition for GHZ-Supported Games via SpreadnessYang P. Liu, Shachar Lovett, Kunal Mittal. [doi]
• Tight Lower Bound for Approximating Parametrized Maximum Likelihood Decoding Under ETHRishav Gupta, Bingkai Lin, Xin Zheng. [doi]
• Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?Cornelius Brand, Radu Curticapean, Petteri Kaski, Baitian Li, Ian Orzel, Tim Seppelt, Jiaheng Wang 0002. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Systematic Data Structure Lower Bounds via the Query-With-Sketch ModelSumegha Garg, Songhua He, Yuanzhi Li, Periklis A. Papakonstantinou, Xin Yang. [doi]
• A Simple Sub-Polynomial Degree Coboundary ExpanderMax Hopkins, Arka Ray. [doi]
• Non-Clifford Gates Are Required for Long-Term MemoryJon Nelson, Joel Rajakumar, Michael J. Gullans. [doi]
• Plethysm is in #BQPMatthias Christandl, Aram W. Harrow, Greta Panova, Pietro M. Posta, Michael Walter 0005. [doi]
• Quantum-Classical Equivalence for And-FunctionsSreejata Kishor Bhattacharya, Farzan Byramji, Arkadev Chattopadhyay, Yogesh Dahiya, Shachar Lovett. [doi]
• Bounded-Independence Sampling of Edges for Combinatorial Graph PropertiesAaron Putterman, Salil P. Vadhan, Vadim Zaripov. [doi]
• Probabilistically Checking Quantum Proofs, with InteractionBaocheng Sun 0002, Thomas Vidick. [doi]
• A Weak Regularity Lemma for PolynomialsGuy Moshkovitz, Dora Woodruff. [doi]
• Condensing and Extracting Against Online AdversariesEshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach, Rocco A. Servedio. [doi]
• Fine-Grained Complexity for Quantum Problems from Size-Preserving Circuit-To-Hamiltonian ConstructionsNai-Hui Chia, Atsuya Hasegawa, François Le Gall, Yu-Ching Shen. [doi]
• Resolution Width Lifts to Near-Quadratic-Depth Res(⊕) SizeDmitry Itsykson, Vladimir Podolskii 0001, Alexander Shekhovtsov 0002. [doi]
• Multiplicative Pseudorandom Generators for Nondeterministic CircuitsAlon Dermer, Ronen Shaltiel. [doi]
• Optimal Depth-Three Circuits for Inner ProductMohit Gurumukhani, Daniel Kleber, Ramamohan Paturi, Christopher D. Rosin, Navid Talebanfard. [doi]
• Polynomial Identity Testing for Read-4 Arithmetic FormulasNimrod Kaplan, Amir Shpilka. [doi]
• When Hilbert Approximates: A Strong Nullstellensatz for Approximate Polynomial SatisfiabilitySanyam Agarwal, Sagnik Dutta, Anurag Pandey 0001, Himanshu Shukla. [doi]
• All Polynomial Generators Preserve Distance with Mutual Correlated AgreementSarah Bordage, Alessandro Chiesa, Ziyi Guan 0001, Ignacio Manzur. [doi]
• Quantum Advantage in Tolerant Junta TestingAvishay Tal, Weiqiang Yuan 0002. [doi]
• Constant-Depth Circuits for Polynomial GCD over Any CharacteristicSomnath Bhattacharjee, Mrinal Kumar 0001, Shanthanu S. Rai, Varun Ramanathan 0002, Ramprasad Saptharishi, Shubhangi Saraf. [doi]
• Asymptotic Rank Speedup Theorems, RevisitedJosh Alman, Baitian Li. [doi]
• Fixed-Parameter Degree Bounds and Complexity of the Orbit Closure Intersection Problem for TensorsM. Levent Dogan, John Maar, Rafael Oliveira 0002, Youming Qiao. [doi]
• Faux DeterminismShalev Ben-David, Mohammad Hossein Ebtehaj. [doi]