Table of Contents

• Sum-Of-Squares Lower Bounds for the Minimum Circuit Size ProblemPer Austrin, Kilian Risse. [doi]
• Generative Models of Huge ObjectsLunjia Hu, Inbal Livni Navon, Omer Reingold. [doi]
• Leakage-Resilient Hardness vs RandomnessYanyi Liu, Rafael Pass. [doi]
• Bounded RelativizationShuichi Hirahara, Zhenjian Lu, Hanlin Ren. [doi]
• Matrix Multiplication and Number on the Forehead CommunicationJosh Alman, Jaroslaw Blasiok. [doi]
• An Algorithmic Approach to Uniform Lower BoundsRahul Santhanam. [doi]
• On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian SimulationNai-Hui Chia, Kai-Min Chung, Yao Ching Hsieh, Han-Hsuan Lin, Yao-Ting Lin, Yu-Ching Shen. [doi]
• Hardness Against Linear Branching Programs and MoreEshan Chattopadhyay, Jyun-Jie Liao. [doi]
• Instance-Wise Hardness Versus Randomness Tradeoffs for Arthur-Merlin ProtocolsDieter van Melkebeek, Nicollas M. Sdroievski. [doi]
• Translationally Invariant Constraint Optimization ProblemsDorit Aharonov, Sandy Irani. [doi]
• On Correlation Bounds Against PolynomialsPeter Ivanov, Liam Pavlovic, Emanuele Viola. [doi]
• Lower Bounds for Polynomial Calculus with Extension Variables over Finite FieldsRussell Impagliazzo, Sasank Mouli, Toniann Pitassi. [doi]
• A Distribution Testing Oracle Separating QMA and QCMAAnand Natarajan, Chinmay Nirkhe. [doi]
• Towards Optimal Depth-Reductions for Algebraic FormulasHervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan 0001, Sébastien Tavenas. [doi]
• On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion ErrorsAlexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li 0006, Yu Zheng, Minshen Zhu. [doi]
• Criticality of AC⁰-FormulaePrahladh Harsha, Tulasimohan Molli, Ashutosh Shankar. [doi]
• A Degree 4 Sum-Of-Squares Lower Bound for the Clique Number of the Paley GraphDmitriy Kunisky, Xifan Yu. [doi]
• An Exponential Separation Between Quantum Query Complexity and the Polynomial DegreeAndris Ambainis, Aleksandrs Belovs. [doi]
• New Lower Bounds Against Homogeneous Non-Commutative CircuitsPrerona Chatterjee, Pavel Hrubes. [doi]
• New Sampling Lower Bounds via the SeparatorEmanuele Viola. [doi]
• Trade-Offs Between Entanglement and CommunicationSrinivasan Arunachalam, Uma Girish. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Colourful TFNP and Propositional ProofsBen Davis, Robert Robere. [doi]
• An Improved Trickle down Theorem for Partite ComplexesDorna Abdolazimi, Shayan Oveis Gharan. [doi]
• Separation of the Factorization Norm and Randomized Communication ComplexityTsunMing Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley. [doi]
• Constant-Depth Circuits vs. Monotone CircuitsBruno Pasqualotto Cavalar, Igor C. Oliveira. [doi]
• A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPsTommaso d'Orsi, Luca Trevisan. [doi]
• Border Complexity of Symbolic Determinant Under Rank One RestrictionAbhranil Chatterjee 0001, Sumanta Ghosh, Rohit Gurjar, Roshan Raj. [doi]
• Tight Correlation Bounds for Circuits Between AC0 and TC0Vinayak M. Kumar. [doi]
• Radical Sylvester-Gallai Theorem for Tuples of QuadraticsAbhibhav Garg, Rafael Oliveira 0006, Shir Peleg, Akash Kumar Sengupta. [doi]
• Near-Optimal Set-Multilinear Formula Lower BoundsDeepanshu Kush, Shubhangi Saraf. [doi]
• On the Algebraic Proof Complexity of Tensor IsomorphismNicola Galesi, Joshua A. Grochow, Toniann Pitassi, Adrian She. [doi]
• The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to ApproximateLennart Bittel, Sevag Gharibian, Martin Kliesch. [doi]
• Spectral Expanding ExpandersGil Cohen, Itay Cohen 0003. [doi]
• Improved Learning from Kolmogorov ComplexityHalley Goldberg, Valentine Kabanets. [doi]
• Derandomization with Minimal Memory FootprintDean Doron, Roei Tell. [doi]
• Reducing Tarski to Unique Tarski (In the Black-Box Model)Xi Chen 0001, Yuhao Li, Mihalis Yannakakis. [doi]