<h2>LIPIcs, Volume 264, CCC 2023</h2>
<ul>
<li>
<span class="authors">Amnon Ta-Shma</span>
<span class="title">LIPIcs, Volume 264, CCC 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023">10.4230/LIPIcs.CCC.2023</a>
</li>
<li>
<span class="authors">Amnon Ta-Shma</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.0">10.4230/LIPIcs.CCC.2023.0</a>
</li>
<li>
<span class="authors">Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, and Morgan Shirley</span>
<span class="title">Separation of the Factorization Norm and Randomized Communication Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.1">10.4230/LIPIcs.CCC.2023.1</a>
</li>
<li>
<span class="authors">Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, and Roshan Raj</span>
<span class="title">Border Complexity of Symbolic Determinant Under Rank One Restriction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.2">10.4230/LIPIcs.CCC.2023.2</a>
</li>
<li>
<span class="authors">Peter Ivanov, Liam Pavlovic, and Emanuele Viola</span>
<span class="title">On Correlation Bounds Against Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.3">10.4230/LIPIcs.CCC.2023.3</a>
</li>
<li>
<span class="authors">Nicola Galesi, Joshua A. Grochow, Toniann Pitassi, and Adrian She</span>
<span class="title">On the Algebraic Proof Complexity of Tensor Isomorphism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.4">10.4230/LIPIcs.CCC.2023.4</a>
</li>
<li>
<span class="authors">Lunjia Hu, Inbal Rachel Livni Navon, and Omer Reingold</span>
<span class="title">Generative Models of Huge Objects</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.5">10.4230/LIPIcs.CCC.2023.5</a>
</li>
<li>
<span class="authors">Shuichi Hirahara, Zhenjian Lu, and Hanlin Ren</span>
<span class="title">Bounded Relativization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.6">10.4230/LIPIcs.CCC.2023.6</a>
</li>
<li>
<span class="authors">Russell Impagliazzo, Sasank Mouli, and Toniann Pitassi</span>
<span class="title">Lower Bounds for Polynomial Calculus with Extension Variables over Finite Fields</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.7">10.4230/LIPIcs.CCC.2023.7</a>
</li>
<li>
<span class="authors">Gil Cohen and Itay Cohen</span>
<span class="title">Spectral Expanding Expanders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.8">10.4230/LIPIcs.CCC.2023.8</a>
</li>
<li>
<span class="authors">Eshan Chattopadhyay and Jyun-Jie Liao</span>
<span class="title">Hardness Against Linear Branching Programs and More</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.9">10.4230/LIPIcs.CCC.2023.9</a>
</li>
<li>
<span class="authors">Dorna Abdolazimi and Shayan Oveis Gharan</span>
<span class="title">An Improved Trickle down Theorem for Partite Complexes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.10">10.4230/LIPIcs.CCC.2023.10</a>
</li>
<li>
<span class="authors">Dean Doron and Roei Tell</span>
<span class="title">Derandomization with Minimal Memory Footprint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.11">10.4230/LIPIcs.CCC.2023.11</a>
</li>
<li>
<span class="authors">Halley Goldberg and Valentine Kabanets</span>
<span class="title">Improved Learning from Kolmogorov Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.12">10.4230/LIPIcs.CCC.2023.12</a>
</li>
<li>
<span class="authors">Prerona Chatterjee and Pavel Hrubeš</span>
<span class="title">New Lower Bounds Against Homogeneous Non-Commutative Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.13">10.4230/LIPIcs.CCC.2023.13</a>
</li>
<li>
<span class="authors">Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, and Minshen Zhu</span>
<span class="title">On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.14">10.4230/LIPIcs.CCC.2023.14</a>
</li>
<li>
<span class="authors">Deepanshu Kush and Shubhangi Saraf</span>
<span class="title">Near-Optimal Set-Multilinear Formula Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.15">10.4230/LIPIcs.CCC.2023.15</a>
</li>
<li>
<span class="authors">Josh Alman and Jarosław Błasiok</span>
<span class="title">Matrix Multiplication and Number on the Forehead Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.16">10.4230/LIPIcs.CCC.2023.16</a>
</li>
<li>
<span class="authors">Dieter van Melkebeek and Nicollas Mocelin Sdroievski</span>
<span class="title">Instance-Wise Hardness Versus Randomness Tradeoffs for Arthur-Merlin Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.17">10.4230/LIPIcs.CCC.2023.17</a>
</li>
<li>
<span class="authors">Vinayak M. Kumar</span>
<span class="title">Tight Correlation Bounds for Circuits Between AC0 and TC0</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.18">10.4230/LIPIcs.CCC.2023.18</a>
</li>
<li>
<span class="authors">Prahladh Harsha, Tulasimohan Molli, and Ashutosh Shankar</span>
<span class="title">Criticality of AC⁰-Formulae</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.19">10.4230/LIPIcs.CCC.2023.19</a>
</li>
<li>
<span class="authors">Abhibhav Garg, Rafael Oliveira, Shir Peleg, and Akash Kumar Sengupta</span>
<span class="title">Radical Sylvester-Gallai Theorem for Tuples of Quadratics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.20">10.4230/LIPIcs.CCC.2023.20</a>
</li>
<li>
<span class="authors">Xi Chen, Yuhao Li, and Mihalis Yannakakis</span>
<span class="title">Reducing Tarski to Unique Tarski (In the Black-Box Model)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.21">10.4230/LIPIcs.CCC.2023.21</a>
</li>
<li>
<span class="authors">Anand Natarajan and Chinmay Nirkhe</span>
<span class="title">A Distribution Testing Oracle Separating QMA and QCMA</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.22">10.4230/LIPIcs.CCC.2023.22</a>
</li>
<li>
<span class="authors">Dorit Aharonov and Sandy Irani</span>
<span class="title">Translationally Invariant Constraint Optimization Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.23">10.4230/LIPIcs.CCC.2023.23</a>
</li>
<li>
<span class="authors">Andris Ambainis and Aleksandrs Belovs</span>
<span class="title">An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.24">10.4230/LIPIcs.CCC.2023.24</a>
</li>
<li>
<span class="authors">Srinivasan Arunachalam and Uma Girish</span>
<span class="title">Trade-Offs Between Entanglement and Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.25">10.4230/LIPIcs.CCC.2023.25</a>
</li>
<li>
<span class="authors">Emanuele Viola</span>
<span class="title">New Sampling Lower Bounds via the Separator</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.26">10.4230/LIPIcs.CCC.2023.26</a>
</li>
<li>
<span class="authors">Tommaso d'Orsi and Luca Trevisan</span>
<span class="title">A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.27">10.4230/LIPIcs.CCC.2023.27</a>
</li>
<li>
<span class="authors">Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, and Sébastien Tavenas</span>
<span class="title">Towards Optimal Depth-Reductions for Algebraic Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.28">10.4230/LIPIcs.CCC.2023.28</a>
</li>
<li>
<span class="authors">Bruno P. Cavalar and Igor C. Oliveira</span>
<span class="title">Constant-Depth Circuits vs. Monotone Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.29">10.4230/LIPIcs.CCC.2023.29</a>
</li>
<li>
<span class="authors">Dmitriy Kunisky and Xifan Yu</span>
<span class="title">A Degree 4 Sum-Of-Squares Lower Bound for the Clique Number of the Paley Graph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.30">10.4230/LIPIcs.CCC.2023.30</a>
</li>
<li>
<span class="authors">Per Austrin and Kilian Risse</span>
<span class="title">Sum-Of-Squares Lower Bounds for the Minimum Circuit Size Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.31">10.4230/LIPIcs.CCC.2023.31</a>
</li>
<li>
<span class="authors">Yanyi Liu and Rafael Pass</span>
<span class="title">Leakage-Resilient Hardness vs Randomness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.32">10.4230/LIPIcs.CCC.2023.32</a>
</li>
<li>
<span class="authors">Nai-Hui Chia, Kai-Min Chung, Yao-Ching Hsieh, Han-Hsuan Lin, Yao-Ting Lin, and Yu-Ching Shen</span>
<span class="title">On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.33">10.4230/LIPIcs.CCC.2023.33</a>
</li>
<li>
<span class="authors">Lennart Bittel, Sevag Gharibian, and Martin Kliesch</span>
<span class="title">The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.34">10.4230/LIPIcs.CCC.2023.34</a>
</li>
<li>
<span class="authors">Rahul Santhanam</span>
<span class="title">An Algorithmic Approach to Uniform Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.35">10.4230/LIPIcs.CCC.2023.35</a>
</li>
<li>
<span class="authors">Ben Davis and Robert Robere</span>
<span class="title">Colourful TFNP and Propositional Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2023.36">10.4230/LIPIcs.CCC.2023.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