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