@Proceedings{santhanam:LIPIcs.CCC.2024,
title = {{LIPIcs, Volume 300, CCC 2024, Complete Volume}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {1--952},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024},
URN = {urn:nbn:de:0030-drops-203955},
doi = {10.4230/LIPIcs.CCC.2024},
annote = {Keywords: LIPIcs, Volume 300, CCC 2024, Complete Volume}
}
@InProceedings{santhanam:LIPIcs.CCC.2024.0,
author = {Santhanam, Rahul},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {0:i--0:xiv},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.0},
URN = {urn:nbn:de:0030-drops-203961},
doi = {10.4230/LIPIcs.CCC.2024.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{hoza:LIPIcs.CCC.2024.1,
author = {Hoza, William M.},
title = {{A Technique for Hardness Amplification Against AC⁰}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {1:1--1:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.1},
URN = {urn:nbn:de:0030-drops-203977},
doi = {10.4230/LIPIcs.CCC.2024.1},
annote = {Keywords: Bounded-depth circuits, average-case lower bounds, hardness amplification, XOR lemmas}
}
@InProceedings{cormode_et_al:LIPIcs.CCC.2024.2,
author = {Cormode, Graham and Dall'Agnol, Marcel and Gur, Tom and Hickey, Chris},
title = {{Streaming Zero-Knowledge Proofs}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {2:1--2:66},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.2},
URN = {urn:nbn:de:0030-drops-203988},
doi = {10.4230/LIPIcs.CCC.2024.2},
annote = {Keywords: Zero-knowledge proofs, streaming algorithms, computational complexity}
}
@InProceedings{bafna_et_al:LIPIcs.CCC.2024.3,
author = {Bafna, Mitali and Minzer, Dor},
title = {{Solving Unique Games over Globally Hypercontractive Graphs}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {3:1--3:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.3},
URN = {urn:nbn:de:0030-drops-203996},
doi = {10.4230/LIPIcs.CCC.2024.3},
annote = {Keywords: unique games, approximation algorithms}
}
@InProceedings{pyne:LIPIcs.CCC.2024.4,
author = {Pyne, Edward},
title = {{Derandomizing Logspace with a Small Shared Hard Drive}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {4:1--4:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.4},
URN = {urn:nbn:de:0030-drops-204006},
doi = {10.4230/LIPIcs.CCC.2024.4},
annote = {Keywords: Catalytic computation, space-bounded computation, derandomization}
}
@InProceedings{cook_et_al:LIPIcs.CCC.2024.5,
author = {Cook, Joshua and Moshkovitz, Dana},
title = {{Explicit Time and Space Efficient Encoders Exist Only with Random Access}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {5:1--5:54},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.5},
URN = {urn:nbn:de:0030-drops-204015},
doi = {10.4230/LIPIcs.CCC.2024.5},
annote = {Keywords: Time-Space Trade Offs, Error Correcting Codes, Encoders, Explicit Constructions, Streaming Lower Bounds, Sequential Access, Time-Space Lower Bounds, Lossless Condensers, Invertible Condensers, Condensers}
}
@InProceedings{grewal_et_al:LIPIcs.CCC.2024.6,
author = {Grewal, Sabee and Yirka, Justin},
title = {{The Entangled Quantum Polynomial Hierarchy Collapses}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {6:1--6:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.6},
URN = {urn:nbn:de:0030-drops-204028},
doi = {10.4230/LIPIcs.CCC.2024.6},
annote = {Keywords: Polynomial hierarchy, Entangled proofs, Correlated proofs, Minimax}
}
@InProceedings{assadi_et_al:LIPIcs.CCC.2024.7,
author = {Assadi, Sepehr and Ghosh, Prantar and Loff, Bruno and Mittal, Parth and Mukhopadhyay, Sagnik},
title = {{Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {7:1--7:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.7},
URN = {urn:nbn:de:0030-drops-204035},
doi = {10.4230/LIPIcs.CCC.2024.7},
annote = {Keywords: Graph streaming, Lower bounds, Communication complexity, k-Cores and degeneracy}
}
@InProceedings{cohen_et_al:LIPIcs.CCC.2024.8,
author = {Cohen, Gil and Yankovitz, Tal},
title = {{Asymptotically-Good RLCCs with (log n)^(2+o(1)) Queries}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {8:1--8:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.8},
URN = {urn:nbn:de:0030-drops-204045},
doi = {10.4230/LIPIcs.CCC.2024.8},
annote = {Keywords: Relaxed locally decodable codes, Relxaed locally correctable codes, RLCC, RLDC}
}
@InProceedings{alekseev_et_al:LIPIcs.CCC.2024.9,
author = {Alekseev, Yaroslav and Filmus, Yuval and Smal, Alexander},
title = {{Lifting Dichotomies}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {9:1--9:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.9},
URN = {urn:nbn:de:0030-drops-204051},
doi = {10.4230/LIPIcs.CCC.2024.9},
annote = {Keywords: decision trees, log-rank conjecture, lifting, parity decision trees}
}
@InProceedings{li_et_al:LIPIcs.CCC.2024.10,
author = {Li, Xin and Zhong, Yan},
title = {{Explicit Directional Affine Extractors and Improved Hardness for Linear Branching Programs}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {10:1--10:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.10},
URN = {urn:nbn:de:0030-drops-204060},
doi = {10.4230/LIPIcs.CCC.2024.10},
annote = {Keywords: Randomness Extractors, Affine, Read-once Linear Branching Programs, Low-degree polynomials, AC⁰ circuits}
}
@InProceedings{holmgren_et_al:LIPIcs.CCC.2024.11,
author = {Holmgren, Justin and Rothblum, Ron},
title = {{Linear-Size Boolean Circuits for Multiselection}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {11:1--11:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.11},
URN = {urn:nbn:de:0030-drops-204070},
doi = {10.4230/LIPIcs.CCC.2024.11},
annote = {Keywords: Private Information Retrieval, Batch Selection, Boolean Circuits}
}
@InProceedings{hrubes:LIPIcs.CCC.2024.12,
author = {Hrube\v{s}, Pavel},
title = {{A Subquadratic Upper Bound on Sum-Of-Squares Composition Formulas}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {12:1--12:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.12},
URN = {urn:nbn:de:0030-drops-204082},
doi = {10.4230/LIPIcs.CCC.2024.12},
annote = {Keywords: Sum-of-squares composition formulas, Hurwitz’s problem, non-commutative arithmetic circuit}
}
@InProceedings{hrubes:LIPIcs.CCC.2024.13,
author = {Hrube\v{s}, Pavel},
title = {{Hard Submatrices for Non-Negative Rank and Communication Complexity}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {13:1--13:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.13},
URN = {urn:nbn:de:0030-drops-204097},
doi = {10.4230/LIPIcs.CCC.2024.13},
annote = {Keywords: Non-negative rank, communication complexity, extension complexity}
}
@InProceedings{burgisser_et_al:LIPIcs.CCC.2024.14,
author = {B\"{u}rgisser, Peter and Do\u{g}an, Mahmut Levent and Makam, Visu and Walter, Michael and Wigderson, Avi},
title = {{Complexity of Robust Orbit Problems for Torus Actions and the abc-Conjecture}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {14:1--14:48},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.14},
URN = {urn:nbn:de:0030-drops-204100},
doi = {10.4230/LIPIcs.CCC.2024.14},
annote = {Keywords: computational invariant theory, geometric complexity theory, orbit problems, abc-conjecture, closest vector problem}
}
@InProceedings{arteche_et_al:LIPIcs.CCC.2024.15,
author = {Arteche, Noel and Carenini, Gaia and Gray, Matthew},
title = {{Quantum Automating TC⁰-Frege Is LWE-Hard}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {15:1--15:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.15},
URN = {urn:nbn:de:0030-drops-204117},
doi = {10.4230/LIPIcs.CCC.2024.15},
annote = {Keywords: automatability, post-quantum cryptography, feasible interpolation}
}
@InProceedings{blanc_et_al:LIPIcs.CCC.2024.16,
author = {Blanc, Guy and Koch, Caleb and Strassle, Carmen and Tan, Li-Yang},
title = {{A Strong Direct Sum Theorem for Distributional Query Complexity}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {16:1--16:30},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.16},
URN = {urn:nbn:de:0030-drops-204123},
doi = {10.4230/LIPIcs.CCC.2024.16},
annote = {Keywords: Query complexity, direct product theorem, hardcore theorem}
}
@InProceedings{gurumukhani_et_al:LIPIcs.CCC.2024.17,
author = {Gurumukhani, Mohit and Paturi, Ramamohan and Pudl\'{a}k, Pavel and Saks, Michael and Talebanfard, Navid},
title = {{Local Enumeration and Majority Lower Bounds}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {17:1--17:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.17},
URN = {urn:nbn:de:0030-drops-204136},
doi = {10.4230/LIPIcs.CCC.2024.17},
annote = {Keywords: Depth 3 circuits, k-CNF satisfiability, Circuit lower bounds, Majority function}
}
@InProceedings{derksen_et_al:LIPIcs.CCC.2024.18,
author = {Derksen, Harm and Ivanov, Peter and Lee, Chin Ho and Viola, Emanuele},
title = {{Pseudorandomness, Symmetry, Smoothing: I}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {18:1--18:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.18},
URN = {urn:nbn:de:0030-drops-204144},
doi = {10.4230/LIPIcs.CCC.2024.18},
annote = {Keywords: pseudorandomness, k-wise uniform distributions, small-bias distributions, noise, symmetric tests, thresholds, Krawtchouk polynomials}
}
@InProceedings{efremenko_et_al:LIPIcs.CCC.2024.19,
author = {Efremenko, Klim and Kol, Gillat and Paramonov, Dmitry and Raz, Ran and Saxena, Raghuvansh R.},
title = {{Information Dissemination via Broadcasts in the Presence of Adversarial Noise}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {19:1--19:33},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.19},
URN = {urn:nbn:de:0030-drops-204159},
doi = {10.4230/LIPIcs.CCC.2024.19},
annote = {Keywords: Radio Networks, Interactive Coding, Error Correcting Codes}
}
@InProceedings{chatterjee_et_al:LIPIcs.CCC.2024.20,
author = {Chatterjee, Prerona and Kush, Deepanshu and Saraf, Shubhangi and Shpilka, Amir},
title = {{Lower Bounds for Set-Multilinear Branching Programs}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {20:1--20:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.20},
URN = {urn:nbn:de:0030-drops-204167},
doi = {10.4230/LIPIcs.CCC.2024.20},
annote = {Keywords: Lower Bounds, Algebraic Branching Programs, Set-multilinear polynomials}
}
@InProceedings{bouland_et_al:LIPIcs.CCC.2024.21,
author = {Bouland, Adam and Fefferman, Bill and Ghosh, Soumik and Metger, Tony and Vazirani, Umesh and Zhang, Chenyi and Zhou, Zixin},
title = {{Public-Key Pseudoentanglement and the Hardness of Learning Ground State Entanglement Structure}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {21:1--21:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.21},
URN = {urn:nbn:de:0030-drops-204175},
doi = {10.4230/LIPIcs.CCC.2024.21},
annote = {Keywords: Quantum computing, Quantum complexity theory, entanglement}
}
@InProceedings{papamakarios:LIPIcs.CCC.2024.22,
author = {Papamakarios, Theodoros},
title = {{Depth-d Frege Systems Are Not Automatable Unless 𝖯 = NP}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {22:1--22:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.22},
URN = {urn:nbn:de:0030-drops-204187},
doi = {10.4230/LIPIcs.CCC.2024.22},
annote = {Keywords: Proof complexity, Automatability, Bounded-depth Frege}
}
@InProceedings{bhattacharya_et_al:LIPIcs.CCC.2024.23,
author = {Bhattacharya, Sreejata Kishor and Chattopadhyay, Arkadev and Dvo\v{r}\'{a}k, Pavel},
title = {{Exponential Separation Between Powers of Regular and General Resolution over Parities}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {23:1--23:32},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.23},
URN = {urn:nbn:de:0030-drops-204191},
doi = {10.4230/LIPIcs.CCC.2024.23},
annote = {Keywords: Proof Complexity, Regular Reslin, Branching Programs, Lifting}
}
@InProceedings{aaronson_et_al:LIPIcs.CCC.2024.24,
author = {Aaronson, Hugo and Gur, Tom and Rajgopal, Ninad and Rothblum, Ron D.},
title = {{Distribution-Free Proofs of Proximity}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {24:1--24:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.24},
URN = {urn:nbn:de:0030-drops-204204},
doi = {10.4230/LIPIcs.CCC.2024.24},
annote = {Keywords: Property Testing, Interactive Proofs, Distribution-Free Property Testing}
}
@InProceedings{kedlaya_et_al:LIPIcs.CCC.2024.25,
author = {Kedlaya, Kiran S. and Kopparty, Swastik},
title = {{On the Degree of Polynomials Computing Square Roots Mod p}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {25:1--25:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.25},
URN = {urn:nbn:de:0030-drops-204219},
doi = {10.4230/LIPIcs.CCC.2024.25},
annote = {Keywords: Algebraic Computation, Polynomials, Computing Square roots, Reed-Solomon Codes}
}
@InProceedings{jeronimo_et_al:LIPIcs.CCC.2024.26,
author = {Jeronimo, Fernando Granha and Wu, Pei},
title = {{Dimension Independent Disentanglers from Unentanglement and Applications}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {26:1--26:28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.26},
URN = {urn:nbn:de:0030-drops-204228},
doi = {10.4230/LIPIcs.CCC.2024.26},
annote = {Keywords: QMA(2), disentangler, quantum proofs}
}
@InProceedings{guruswami_et_al:LIPIcs.CCC.2024.27,
author = {Guruswami, Venkatesan and Ren, Xuandi and Sandeep, Sai},
title = {{Baby PIH: Parameterized Inapproximability of Min CSP}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {27:1--27:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.27},
URN = {urn:nbn:de:0030-drops-204237},
doi = {10.4230/LIPIcs.CCC.2024.27},
annote = {Keywords: Parameterized Inapproximability Hypothesis, Constraint Satisfaction Problems}
}
@InProceedings{chakrabarti_et_al:LIPIcs.CCC.2024.28,
author = {Chakrabarti, Amit and Stoeckl, Manuel},
title = {{Finding Missing Items Requires Strong Forms of Randomness}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {28:1--28:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.28},
URN = {urn:nbn:de:0030-drops-204242},
doi = {10.4230/LIPIcs.CCC.2024.28},
annote = {Keywords: Data streaming, lower bounds, space complexity, adversarial robustness, derandomization, sketching, sampling}
}
@InProceedings{hirahara_et_al:LIPIcs.CCC.2024.29,
author = {Hirahara, Shuichi and Kabanets, Valentine and Lu, Zhenjian and Oliveira, Igor C.},
title = {{Exact Search-To-Decision Reductions for Time-Bounded Kolmogorov Complexity}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {29:1--29:56},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.29},
URN = {urn:nbn:de:0030-drops-204256},
doi = {10.4230/LIPIcs.CCC.2024.29},
annote = {Keywords: average-case complexity, Kolmogorov complexity, search-to-decision reductions}
}
@InProceedings{dong_et_al:LIPIcs.CCC.2024.30,
author = {Dong, Yangjing and Fu, Honghao and Natarajan, Anand and Qin, Minglong and Xu, Haochen and Yao, Penghui},
title = {{The Computational Advantage of MIP^∗ Vanishes in the Presence of Noise}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {30:1--30:71},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.30},
URN = {urn:nbn:de:0030-drops-204263},
doi = {10.4230/LIPIcs.CCC.2024.30},
annote = {Keywords: Interactive proofs, Quantum complexity theory, Quantum entanglement, Fourier analysis, Matrix analysis, Invariance principle, Derandomization, PCP, Locally testable code, Positivity testing}
}
@InProceedings{forbes:LIPIcs.CCC.2024.31,
author = {Forbes, Michael A.},
title = {{Low-Depth Algebraic Circuit Lower Bounds over Any Field}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {31:1--31:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.31},
URN = {urn:nbn:de:0030-drops-204271},
doi = {10.4230/LIPIcs.CCC.2024.31},
annote = {Keywords: algebraic circuits, lower bounds, low-depth circuits, positive characteristic}
}
@InProceedings{cheng_et_al:LIPIcs.CCC.2024.32,
author = {Cheng, Kuan and Wang, Yichuan},
title = {{BPL ⊆ L-AC¹}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {32:1--32:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.32},
URN = {urn:nbn:de:0030-drops-204282},
doi = {10.4230/LIPIcs.CCC.2024.32},
annote = {Keywords: Randomized Space Complexity, Circuit Complexity, Derandomization}
}
@InProceedings{garlik:LIPIcs.CCC.2024.33,
author = {Garl{\'\i}k, Michal},
title = {{Failure of Feasible Disjunction Property for k-DNF Resolution and NP-Hardness of Automating It}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {33:1--33:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.33},
URN = {urn:nbn:de:0030-drops-204295},
doi = {10.4230/LIPIcs.CCC.2024.33},
annote = {Keywords: reflection principle, feasible disjunction property, k-DNF Resolution}
}
@InProceedings{mazor_et_al:LIPIcs.CCC.2024.34,
author = {Mazor, Noam and Pass, Rafael},
title = {{Search-To-Decision Reductions for Kolmogorov Complexity}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {34:1--34:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.34},
URN = {urn:nbn:de:0030-drops-204308},
doi = {10.4230/LIPIcs.CCC.2024.34},
annote = {Keywords: Kolmogorov complexity, search to decision}
}
@InProceedings{alman_et_al:LIPIcs.CCC.2024.35,
author = {Alman, Josh and Guan, Yunfeng},
title = {{Finer-Grained Hardness of Kernel Density Estimation}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {35:1--35:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.35},
URN = {urn:nbn:de:0030-drops-204311},
doi = {10.4230/LIPIcs.CCC.2024.35},
annote = {Keywords: Kernel Density Estimation, Fine-Grained Complexity, Schur Polynomials}
}
@InProceedings{mazor_et_al:LIPIcs.CCC.2024.36,
author = {Mazor, Noam and Pass, Rafael},
title = {{Gap MCSP Is Not (Levin) NP-Complete in Obfustopia}},
booktitle = {39th Computational Complexity Conference (CCC 2024)},
pages = {36:1--36:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-331-7},
ISSN = {1868-8969},
year = {2024},
volume = {300},
editor = {Santhanam, Rahul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2024.36},
URN = {urn:nbn:de:0030-drops-204322},
doi = {10.4230/LIPIcs.CCC.2024.36},
annote = {Keywords: Kolmogorov complexity, MCSP, Levin Reduction}
}
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