LIPIcs, Volume 300, CCC 2024

• Rahul Santhanam LIPIcs, Volume 300, CCC 2024, Complete Volume 10.4230/LIPIcs.CCC.2024
• Rahul Santhanam Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.CCC.2024.0
• William M. Hoza A Technique for Hardness Amplification Against AC⁰ 10.4230/LIPIcs.CCC.2024.1
• Graham Cormode, Marcel Dall'Agnol, Tom Gur, and Chris Hickey Streaming Zero-Knowledge Proofs 10.4230/LIPIcs.CCC.2024.2
• Mitali Bafna and Dor Minzer Solving Unique Games over Globally Hypercontractive Graphs 10.4230/LIPIcs.CCC.2024.3
• Edward Pyne Derandomizing Logspace with a Small Shared Hard Drive 10.4230/LIPIcs.CCC.2024.4
• Joshua Cook and Dana Moshkovitz Explicit Time and Space Efficient Encoders Exist Only with Random Access 10.4230/LIPIcs.CCC.2024.5
• Sabee Grewal and Justin Yirka The Entangled Quantum Polynomial Hierarchy Collapses 10.4230/LIPIcs.CCC.2024.6
• Sepehr Assadi, Prantar Ghosh, Bruno Loff, Parth Mittal, and Sagnik Mukhopadhyay Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy 10.4230/LIPIcs.CCC.2024.7
• Gil Cohen and Tal Yankovitz Asymptotically-Good RLCCs with (log n)^(2+o(1)) Queries 10.4230/LIPIcs.CCC.2024.8
• Yaroslav Alekseev, Yuval Filmus, and Alexander Smal Lifting Dichotomies 10.4230/LIPIcs.CCC.2024.9
• Xin Li and Yan Zhong Explicit Directional Affine Extractors and Improved Hardness for Linear Branching Programs 10.4230/LIPIcs.CCC.2024.10
• Justin Holmgren and Ron Rothblum Linear-Size Boolean Circuits for Multiselection 10.4230/LIPIcs.CCC.2024.11
• Pavel Hrubeš A Subquadratic Upper Bound on Sum-Of-Squares Composition Formulas 10.4230/LIPIcs.CCC.2024.12
• Pavel Hrubeš Hard Submatrices for Non-Negative Rank and Communication Complexity 10.4230/LIPIcs.CCC.2024.13
• Peter Bürgisser, Mahmut Levent Doğan, Visu Makam, Michael Walter, and Avi Wigderson Complexity of Robust Orbit Problems for Torus Actions and the abc-Conjecture 10.4230/LIPIcs.CCC.2024.14
• Noel Arteche, Gaia Carenini, and Matthew Gray Quantum Automating TC⁰-Frege Is LWE-Hard 10.4230/LIPIcs.CCC.2024.15
• Guy Blanc, Caleb Koch, Carmen Strassle, and Li-Yang Tan A Strong Direct Sum Theorem for Distributional Query Complexity 10.4230/LIPIcs.CCC.2024.16
• Mohit Gurumukhani, Ramamohan Paturi, Pavel Pudlák, Michael Saks, and Navid Talebanfard Local Enumeration and Majority Lower Bounds 10.4230/LIPIcs.CCC.2024.17
• Harm Derksen, Peter Ivanov, Chin Ho Lee, and Emanuele Viola Pseudorandomness, Symmetry, Smoothing: I 10.4230/LIPIcs.CCC.2024.18
• Klim Efremenko, Gillat Kol, Dmitry Paramonov, Ran Raz, and Raghuvansh R. Saxena Information Dissemination via Broadcasts in the Presence of Adversarial Noise 10.4230/LIPIcs.CCC.2024.19
• Prerona Chatterjee, Deepanshu Kush, Shubhangi Saraf, and Amir Shpilka Lower Bounds for Set-Multilinear Branching Programs 10.4230/LIPIcs.CCC.2024.20
• Adam Bouland, Bill Fefferman, Soumik Ghosh, Tony Metger, Umesh Vazirani, Chenyi Zhang, and Zixin Zhou Public-Key Pseudoentanglement and the Hardness of Learning Ground State Entanglement Structure 10.4230/LIPIcs.CCC.2024.21
• Theodoros Papamakarios Depth-d Frege Systems Are Not Automatable Unless 𝖯 = NP 10.4230/LIPIcs.CCC.2024.22
• Sreejata Kishor Bhattacharya, Arkadev Chattopadhyay, and Pavel Dvořák Exponential Separation Between Powers of Regular and General Resolution over Parities 10.4230/LIPIcs.CCC.2024.23
• Hugo Aaronson, Tom Gur, Ninad Rajgopal, and Ron D. Rothblum Distribution-Free Proofs of Proximity 10.4230/LIPIcs.CCC.2024.24
• Kiran S. Kedlaya and Swastik Kopparty On the Degree of Polynomials Computing Square Roots Mod p 10.4230/LIPIcs.CCC.2024.25
• Fernando Granha Jeronimo and Pei Wu Dimension Independent Disentanglers from Unentanglement and Applications 10.4230/LIPIcs.CCC.2024.26
• Venkatesan Guruswami, Xuandi Ren, and Sai Sandeep Baby PIH: Parameterized Inapproximability of Min CSP 10.4230/LIPIcs.CCC.2024.27
• Amit Chakrabarti and Manuel Stoeckl Finding Missing Items Requires Strong Forms of Randomness 10.4230/LIPIcs.CCC.2024.28
• Shuichi Hirahara, Valentine Kabanets, Zhenjian Lu, and Igor C. Oliveira Exact Search-To-Decision Reductions for Time-Bounded Kolmogorov Complexity 10.4230/LIPIcs.CCC.2024.29
• Yangjing Dong, Honghao Fu, Anand Natarajan, Minglong Qin, Haochen Xu, and Penghui Yao The Computational Advantage of MIP^∗ Vanishes in the Presence of Noise 10.4230/LIPIcs.CCC.2024.30
• Michael A. Forbes Low-Depth Algebraic Circuit Lower Bounds over Any Field 10.4230/LIPIcs.CCC.2024.31
• Kuan Cheng and Yichuan Wang BPL ⊆ L-AC¹ 10.4230/LIPIcs.CCC.2024.32
• Michal Garlík Failure of Feasible Disjunction Property for k-DNF Resolution and NP-Hardness of Automating It 10.4230/LIPIcs.CCC.2024.33
• Noam Mazor and Rafael Pass Search-To-Decision Reductions for Kolmogorov Complexity 10.4230/LIPIcs.CCC.2024.34
• Josh Alman and Yunfeng Guan Finer-Grained Hardness of Kernel Density Estimation 10.4230/LIPIcs.CCC.2024.35
• Noam Mazor and Rafael Pass Gap MCSP Is Not (Levin) NP-Complete in Obfustopia 10.4230/LIPIcs.CCC.2024.36