Table of Contents

• Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching ProgramsLouis Golowich, Salil P. Vadhan. [doi]
• On Efficient Noncommutative Polynomial Factorization via Higman LinearizationVikraman Arvind, Pushkar S. Joglekar. [doi]
• The Approximate Degree of Bipartite Perfect MatchingGal Beniamini. [doi]
• Derandomization from Time-Space TradeoffsOliver Korten. [doi]
• Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFsLijie Chen 0001, Jiatu Li, Tianqi Yang 0001. [doi]
• On the Partial Derivative Method Applied to Lopsided Set-Multilinear PolynomialsNutan Limaye, Srikanth Srinivasan 0001, Sébastien Tavenas. [doi]
• Hardness of Approximation for Stochastic Problems via Interactive Oracle ProofsGal Arnon, Alessandro Chiesa, Eylon Yogev. [doi]
• A Better-Than-3log(n) Depth Lower Bound for De Morgan Formulas with Restrictions on Top GatesIvan Mihajlin, Anastasia Sofronova. [doi]
• The Plane Test Is a Local Tester for Multiplicity CodesDan Karliner, Roie Salama, Amnon Ta-Shma. [doi]
• The Composition Complexity of MajorityVictor Lecomte, Prasanna Ramakrishnan, Li-Yang Tan. [doi]
• Optimal-Degree Polynomial Approximations for Exponentials and Gaussian Kernel Density EstimationAmol Aggarwal, Josh Alman. [doi]
• Interactive Oracle Proofs of Proximity to Algebraic Geometry CodesSarah Bordage, Mathieu Lhotel, Jade Nardi, Hugues Randriam. [doi]
• Nisan-Wigderson Generators in Proof Complexity: New Lower BoundsErfan Khaniki. [doi]
• Quantum Search-To-Decision Reductions and the State Synthesis ProblemSandy Irani, Anand Natarajan, Chinmay Nirkhe, Sujit Rao, Henry Yuen. [doi]
• Improved Low-Depth Set-Multilinear Circuit Lower BoundsDeepanshu Kush, Shubhangi Saraf. [doi]
• New Near-Linear Time Decodable Codes Closer to the GV BoundGuy Blanc, Dean Doron. [doi]
• Finding Errorless Pessiland in Error-Prone HeuristicaShuichi Hirahara, Mikito Nanashima. [doi]
• Vanishing Spaces of Random Sets and Applications to Reed-Muller CodesSiddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan 0001. [doi]
• Pseudorandom Generators, Resolution and Heavy WidthDmitry Sokolov 0001. [doi]
• Certifying Solution Geometry in Random CSPs: Counts, Clusters and BalanceJun-Ting Hsieh, Sidhanth Mohanty, Jeff Xu. [doi]
• Characterizing Derandomization Through Hardness of Levin-Kolmogorov ComplexityYanyi Liu, Rafael Pass. [doi]
• Symmetry of Information from Meta-ComplexityShuichi Hirahara. [doi]
• On Randomized Reductions to the Random StringsMichael Saks, Rahul Santhanam. [doi]
• The Acrobatics of BQPScott Aaronson, DeVon Ingram, William Kretschmer. [doi]
• Subrank and Optimal Reduction of Scalar Multiplications to Generic TensorsHarm Derksen, Visu Makam, Jeroen Zuiddam. [doi]
• Probabilistic Kolmogorov Complexity with Applications to Average-Case ComplexityHalley Goldberg, Valentine Kabanets, Zhenjian Lu, Igor Carboni Oliveira. [doi]
• Trading Time and Space in Catalytic Branching ProgramsJames Cook, Ian Mertz. [doi]
• Hitting Sets for Regular Branching ProgramsAndrej Bogdanov, William M. Hoza, Gautam Prakriya, Edward Pyne. [doi]
• Influence in Completely Bounded Block-Multilinear Forms and Classical Simulation of Quantum AlgorithmsNikhil Bansal 0001, Makrand Sinha, Ronald de Wolf. [doi]
• Almost Polynomial Factor Inapproximability for Parameterized k-CliqueKarthik C. S., Subhash Khot. [doi]
• High-Dimensional Expanders from Chevalley GroupsRyan O'Donnell, Kevin Pratt. [doi]
• Linear Branching Programs and Directional Affine ExtractorsSvyatoslav Gryaznov, Pavel Pudlák, Navid Talebanfard. [doi]
• Further Collapses in TFNPMika Göös, Alexandros Hollender, Siddhartha Jain 0002, Gilbert Maystre, William Pires, Robert Robere, Ran Tao. [doi]
• p-Spread and Restricted Isometry Properties of Sparse Random MatricesVenkatesan Guruswami, Peter Manohar, Jonathan Mosheiff. [doi]
• On the Satisfaction Probability of k-CNF FormulasTill Tantau. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• On One-Way Functions from NP-Complete ProblemsYanyi Liu, Rafael Pass. [doi]
• Improved Pseudorandom Generators for AC⁰ CircuitsXin Lyu. [doi]
• Random Restrictions and PRGs for PTFs in Gaussian SpaceZander Kelley, Raghu Meka. [doi]