<h2>LIPIcs, Volume 200, CCC 2021</h2>
<ul>
<li>
<span class="authors">Valentine Kabanets</span>
<span class="title">LIPIcs, Volume 200, CCC 2021, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021">10.4230/LIPIcs.CCC.2021</a>
</li>
<li>
<span class="authors">Valentine Kabanets</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.0">10.4230/LIPIcs.CCC.2021.0</a>
</li>
<li>
<span class="authors">Gil Cohen and Tal Yankovitz</span>
<span class="title">Rate Amplification and Query-Efficient Distance Amplification for Linear LCC and LDC</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.1">10.4230/LIPIcs.CCC.2021.1</a>
</li>
<li>
<span class="authors">Nati Linial and Adi Shraibman</span>
<span class="title">An Improved Protocol for the Exactly-N Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.2">10.4230/LIPIcs.CCC.2021.2</a>
</li>
<li>
<span class="authors">Dmitry Itsykson and Artur Riazanov</span>
<span class="title">Proof Complexity of Natural Formulas via Communication Arguments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.3">10.4230/LIPIcs.CCC.2021.3</a>
</li>
<li>
<span class="authors">Mrinal Kumar and Ben Lee Volk</span>
<span class="title">A Lower Bound on Determinantal Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.4">10.4230/LIPIcs.CCC.2021.4</a>
</li>
<li>
<span class="authors">Mark Braverman and Dor Minzer</span>
<span class="title">Optimal Tiling of the Euclidean Space Using Permutation-Symmetric Bodies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.5">10.4230/LIPIcs.CCC.2021.5</a>
</li>
<li>
<span class="authors">Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, and Avi Wigderson</span>
<span class="title">On the Power and Limitations of Branch and Cut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.6">10.4230/LIPIcs.CCC.2021.6</a>
</li>
<li>
<span class="authors">Prerona Chatterjee</span>
<span class="title">Separating ABPs and Some Structured Formulas in the Non-Commutative Setting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.7">10.4230/LIPIcs.CCC.2021.7</a>
</li>
<li>
<span class="authors">Alexander Golovnev and Ishay Haviv</span>
<span class="title">The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.8">10.4230/LIPIcs.CCC.2021.8</a>
</li>
<li>
<span class="authors">Pavel Hrubeš and Amir Yehudayoff</span>
<span class="title">Shadows of Newton Polytopes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.9">10.4230/LIPIcs.CCC.2021.9</a>
</li>
<li>
<span class="authors">Eshan Chattopadhyay, Jason Gaitonde, Chin Ho Lee, Shachar Lovett, and Abhishek Shetty</span>
<span class="title">Fractional Pseudorandom Generators from Any Fourier Level</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.10">10.4230/LIPIcs.CCC.2021.10</a>
</li>
<li>
<span class="authors">Pranjal Dutta, Prateek Dwivedi, and Nitin Saxena</span>
<span class="title">Deterministic Identity Testing Paradigms for Bounded Top-Fanin Depth-4 Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.11">10.4230/LIPIcs.CCC.2021.11</a>
</li>
<li>
<span class="authors">Oded Goldreich and Avi Wigderson</span>
<span class="title">Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.12">10.4230/LIPIcs.CCC.2021.12</a>
</li>
<li>
<span class="authors">W. Cole Franks and Philipp Reichenbach</span>
<span class="title">Barriers for Recent Methods in Geodesic Optimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.13">10.4230/LIPIcs.CCC.2021.13</a>
</li>
<li>
<span class="authors">Marshall Ball, Oded Goldreich, and Tal Malkin</span>
<span class="title">Communication Complexity with Defective Randomness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.14">10.4230/LIPIcs.CCC.2021.14</a>
</li>
<li>
<span class="authors">Troy Lee, Tongyang Li, Miklos Santha, and Shengyu Zhang</span>
<span class="title">On the Cut Dimension of a Graph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.15">10.4230/LIPIcs.CCC.2021.15</a>
</li>
<li>
<span class="authors">Joshua A. Grochow and Youming Qiao</span>
<span class="title">On p-Group Isomorphism: Search-To-Decision, Counting-To-Decision, and Nilpotency Class Reductions via Tensors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.16">10.4230/LIPIcs.CCC.2021.16</a>
</li>
<li>
<span class="authors">Anastasia Sofronova and Dmitry Sokolov</span>
<span class="title">Branching Programs with Bounded Repetitions and Flow Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.17">10.4230/LIPIcs.CCC.2021.17</a>
</li>
<li>
<span class="authors">Mika Göös and Gilbert Maystre</span>
<span class="title">A Majority Lemma for Randomised Query Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.18">10.4230/LIPIcs.CCC.2021.18</a>
</li>
<li>
<span class="authors">Dori Medini and Amir Shpilka</span>
<span class="title">Hitting Sets and Reconstruction for Dense Orbits in VP_{e} and ΣΠΣ Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.19">10.4230/LIPIcs.CCC.2021.19</a>
</li>
<li>
<span class="authors">Zeyu Guo</span>
<span class="title">Variety Evasive Subspace Families</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.20">10.4230/LIPIcs.CCC.2021.20</a>
</li>
<li>
<span class="authors">Yaroslav Alekseev</span>
<span class="title">A Lower Bound for Polynomial Calculus with Extension Rule</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.21">10.4230/LIPIcs.CCC.2021.21</a>
</li>
<li>
<span class="authors">Gil Cohen, Dean Doron, Oren Renard, Ori Sberlo, and Amnon Ta-Shma</span>
<span class="title">Error Reduction for Weighted PRGs Against Read Once Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.22">10.4230/LIPIcs.CCC.2021.22</a>
</li>
<li>
<span class="authors">Pravesh K. Kothari and Peter Manohar</span>
<span class="title">A Stress-Free Sum-Of-Squares Lower Bound for Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.23">10.4230/LIPIcs.CCC.2021.23</a>
</li>
<li>
<span class="authors">Vishnu Iyer, Avishay Tal, and Michael Whitmeyer</span>
<span class="title">Junta Distance Approximation with Sub-Exponential Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.24">10.4230/LIPIcs.CCC.2021.24</a>
</li>
<li>
<span class="authors">Pranjal Dutta, Gorav Jindal, Anurag Pandey, and Amit Sinhababu</span>
<span class="title">Arithmetic Circuit Complexity of Division and Truncation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.25">10.4230/LIPIcs.CCC.2021.25</a>
</li>
<li>
<span class="authors">Shuo Pang</span>
<span class="title">SOS Lower Bound for Exact Planted Clique</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.26">10.4230/LIPIcs.CCC.2021.26</a>
</li>
<li>
<span class="authors">Rahul Jain and Srijita Kundu</span>
<span class="title">A Direct Product Theorem for One-Way Quantum Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.27">10.4230/LIPIcs.CCC.2021.27</a>
</li>
<li>
<span class="authors">Simon Apers and Troy Lee</span>
<span class="title">Quantum Complexity of Minimum Cut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.28">10.4230/LIPIcs.CCC.2021.28</a>
</li>
<li>
<span class="authors">Markus Bläser, Julian Dörfler, and Christian Ikenmeyer</span>
<span class="title">On the Complexity of Evaluating Highest Weight Vectors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.29">10.4230/LIPIcs.CCC.2021.29</a>
</li>
<li>
<span class="authors">Anurag Anshu, Shalev Ben-David, and Srijita Kundu</span>
<span class="title">On Query-To-Communication Lifting for Adversary Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.30">10.4230/LIPIcs.CCC.2021.30</a>
</li>
<li>
<span class="authors">Shuichi Hirahara, Rahul Ilango, and Bruno Loff</span>
<span class="title">Hardness of Constant-Round Communication Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.31">10.4230/LIPIcs.CCC.2021.31</a>
</li>
<li>
<span class="authors">Peter Bürgisser, M. Levent Doğan, Visu Makam, Michael Walter, and Avi Wigderson</span>
<span class="title">Polynomial Time Algorithms in Invariant Theory for Torus Actions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.32">10.4230/LIPIcs.CCC.2021.32</a>
</li>
<li>
<span class="authors">Edward Pyne and Salil Vadhan</span>
<span class="title">Pseudodistributions That Beat All Pseudorandom Generators (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.33">10.4230/LIPIcs.CCC.2021.33</a>
</li>
<li>
<span class="authors">Isolde Adler, Noleen Köhler, and Pan Peng</span>
<span class="title">GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.34">10.4230/LIPIcs.CCC.2021.34</a>
</li>
<li>
<span class="authors">Hanlin Ren and Rahul Santhanam</span>
<span class="title">Hardness of KT Characterizes Parallel Cryptography</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.35">10.4230/LIPIcs.CCC.2021.35</a>
</li>
<li>
<span class="authors">Shafi Goldwasser, Russell Impagliazzo, Toniann Pitassi, and Rahul Santhanam</span>
<span class="title">On the Pseudo-Deterministic Query Complexity of NP Search Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.36">10.4230/LIPIcs.CCC.2021.36</a>
</li>
<li>
<span class="authors">Akshay Kamath, Eric Price, and David P. Woodruff</span>
<span class="title">A Simple Proof of a New Set Disjointness with Applications to Data Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.37">10.4230/LIPIcs.CCC.2021.37</a>
</li>
<li>
<span class="authors">Ivan Mihajlin and Alexander Smal</span>
<span class="title">Toward Better Depth Lower Bounds: The XOR-KRW Conjecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.38">10.4230/LIPIcs.CCC.2021.38</a>
</li>
<li>
<span class="authors">Uma Girish, Avishay Tal, and Kewen Wu</span>
<span class="title">Fourier Growth of Parity Decision Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.39">10.4230/LIPIcs.CCC.2021.39</a>
</li>
<li>
<span class="authors">Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, and Dmitry Sokolov</span>
<span class="title">The Power of Negative Reasoning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.40">10.4230/LIPIcs.CCC.2021.40</a>
</li>
<li>
<span class="authors">László Babai and Bohdan Kivva</span>
<span class="title">Matrix Rigidity Depends on the Target Field</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2021.41">10.4230/LIPIcs.CCC.2021.41</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