<h2>LIPIcs, Volume 169, CCC 2020</h2>
<ul>
<li>
<span class="authors">Shubhangi Saraf</span>
<span class="title">LIPIcs, Volume 169, CCC 2020, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020">10.4230/LIPIcs.CCC.2020</a>
</li>
<li>
<span class="authors">Shubhangi Saraf</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.0">10.4230/LIPIcs.CCC.2020.0</a>
</li>
<li>
<span class="authors">Avraham Ben-Aroya, Dean Doron, and Amnon Ta-Shma</span>
<span class="title">Near-Optimal Erasure List-Decodable Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.1">10.4230/LIPIcs.CCC.2020.1</a>
</li>
<li>
<span class="authors">Prerona Chatterjee, Mrinal Kumar, Adrian She, and Ben Lee Volk</span>
<span class="title">A Quadratic Lower Bound for Algebraic Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.2">10.4230/LIPIcs.CCC.2020.2</a>
</li>
<li>
<span class="authors">Dominik Scheder and Navid Talebanfard</span>
<span class="title">Super Strong ETH Is True for PPSZ with Small Resolution Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.3">10.4230/LIPIcs.CCC.2020.3</a>
</li>
<li>
<span class="authors">Jin-Yi Cai, Tianyu Liu, Pinyan Lu, and Jing Yu</span>
<span class="title">Approximability of the Eight-Vertex Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.4">10.4230/LIPIcs.CCC.2020.4</a>
</li>
<li>
<span class="authors">Mrinal Kumar and Ben Lee Volk</span>
<span class="title">Lower Bounds for Matrix Factorization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.5">10.4230/LIPIcs.CCC.2020.5</a>
</li>
<li>
<span class="authors">Dean Doron, Pooya Hatami, and William M. Hoza</span>
<span class="title">Log-Seed Pseudorandom Generators via Iterated Restrictions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.6">10.4230/LIPIcs.CCC.2020.6</a>
</li>
<li>
<span class="authors">Scott Aaronson, Robin Kothari, William Kretschmer, and Justin Thaler</span>
<span class="title">Quantum Lower Bounds for Approximate Counting via Laurent Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.7">10.4230/LIPIcs.CCC.2020.7</a>
</li>
<li>
<span class="authors">Shir Peleg and Amir Shpilka</span>
<span class="title">A Generalized Sylvester-Gallai Type Theorem for Quadratic Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.8">10.4230/LIPIcs.CCC.2020.8</a>
</li>
<li>
<span class="authors">Amey Bhangale and Subhash Khot</span>
<span class="title">Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.9">10.4230/LIPIcs.CCC.2020.9</a>
</li>
<li>
<span class="authors">Kuan Cheng and William M. Hoza</span>
<span class="title">Hitting Sets Give Two-Sided Derandomization of Small Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.10">10.4230/LIPIcs.CCC.2020.10</a>
</li>
<li>
<span class="authors">Gil Cohen and Shahar Samocha</span>
<span class="title">Palette-Alternating Tree Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.11">10.4230/LIPIcs.CCC.2020.11</a>
</li>
<li>
<span class="authors">Ankit Garg, Christian Ikenmeyer, Visu Makam, Rafael Oliveira, Michael Walter, and Avi Wigderson</span>
<span class="title">Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.12">10.4230/LIPIcs.CCC.2020.12</a>
</li>
<li>
<span class="authors">Matthew Coulson, Ewan Davies, Alexandra Kolla, Viresh Patel, and Guus Regts</span>
<span class="title">Statistical Physics Approaches to Unique Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.13">10.4230/LIPIcs.CCC.2020.13</a>
</li>
<li>
<span class="authors">Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, and Srikanth Srinivasan</span>
<span class="title">Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.14">10.4230/LIPIcs.CCC.2020.14</a>
</li>
<li>
<span class="authors">Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, and Igor C. Oliveira</span>
<span class="title">Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.15">10.4230/LIPIcs.CCC.2020.15</a>
</li>
<li>
<span class="authors">Scott Aaronson, Nai-Hui Chia, Han-Hsuan Lin, Chunhao Wang, and Ruizhe Zhang</span>
<span class="title">On the Quantum Complexity of Closest Pair and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.16">10.4230/LIPIcs.CCC.2020.16</a>
</li>
<li>
<span class="authors">Yuval Filmus, Yuval Ishai, Avi Kaplan, and Guy Kindler</span>
<span class="title">Limits of Preprocessing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.17">10.4230/LIPIcs.CCC.2020.17</a>
</li>
<li>
<span class="authors">Hamed Hatami, Kaave Hosseini, and Shachar Lovett</span>
<span class="title">Sign Rank vs Discrepancy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.18">10.4230/LIPIcs.CCC.2020.18</a>
</li>
<li>
<span class="authors">Mika Göös, Pritish Kamath, Katerina Sotiraki, and Manolis Zampetakis</span>
<span class="title">On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.19">10.4230/LIPIcs.CCC.2020.19</a>
</li>
<li>
<span class="authors">Shuichi Hirahara</span>
<span class="title">Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom Generator Constructions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.20">10.4230/LIPIcs.CCC.2020.20</a>
</li>
<li>
<span class="authors">Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, and Nitin Saurabh</span>
<span class="title">Algebraic Branching Programs, Border Complexity, and Tangent Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.21">10.4230/LIPIcs.CCC.2020.21</a>
</li>
<li>
<span class="authors">Rahul Ilango, Bruno Loff, and Igor C. Oliveira</span>
<span class="title">NP-Hardness of Circuit Minimization for Multi-Output Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.22">10.4230/LIPIcs.CCC.2020.22</a>
</li>
<li>
<span class="authors">Nikhil Gupta, Chandan Saha, and Bhargav Thankey</span>
<span class="title">A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.23">10.4230/LIPIcs.CCC.2020.23</a>
</li>
<li>
<span class="authors">Alexander Kozachinskiy and Vladimir Podolskii</span>
<span class="title">Multiparty Karchmer - Wigderson Games and Threshold Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.24">10.4230/LIPIcs.CCC.2020.24</a>
</li>
<li>
<span class="authors">Eshan Chattopadhyay and Jyun-Jie Liao</span>
<span class="title">Optimal Error Pseudodistributions for Read-Once Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.25">10.4230/LIPIcs.CCC.2020.25</a>
</li>
<li>
<span class="authors">Michael Saks and Rahul Santhanam</span>
<span class="title">Circuit Lower Bounds from NP-Hardness of MCSP Under Turing Reductions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.26">10.4230/LIPIcs.CCC.2020.26</a>
</li>
<li>
<span class="authors">Marvin Künnemann and Dániel Marx</span>
<span class="title">Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.27">10.4230/LIPIcs.CCC.2020.27</a>
</li>
<li>
<span class="authors">Susanna F. de Rezende, Jakob Nordström, Kilian Risse, and Dmitry Sokolov</span>
<span class="title">Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.28">10.4230/LIPIcs.CCC.2020.28</a>
</li>
<li>
<span class="authors">Laurent Bartholdi, Michael Figelius, Markus Lohrey, and Armin Weiß</span>
<span class="title">Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.29">10.4230/LIPIcs.CCC.2020.29</a>
</li>
<li>
<span class="authors">Jacques Dark and Christian Konrad</span>
<span class="title">Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.30">10.4230/LIPIcs.CCC.2020.30</a>
</li>
<li>
<span class="authors">Rahul Ilango</span>
<span class="title">Connecting Perebor Conjectures: Towards a Search to Decision Reduction for Minimizing Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.31">10.4230/LIPIcs.CCC.2020.31</a>
</li>
<li>
<span class="authors">Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, and Manaswi Paraashar</span>
<span class="title">Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.32">10.4230/LIPIcs.CCC.2020.32</a>
</li>
<li>
<span class="authors">Amit Sinhababu and Thomas Thierauf</span>
<span class="title">Factorization of Polynomials Given By Arithmetic Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.33">10.4230/LIPIcs.CCC.2020.33</a>
</li>
<li>
<span class="authors">Daniel Dadush and Samarth Tiwari</span>
<span class="title">On the Complexity of Branching Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.34">10.4230/LIPIcs.CCC.2020.34</a>
</li>
<li>
<span class="authors">Swastik Kopparty, Guy Moshkovitz, and Jeroen Zuiddam</span>
<span class="title">Geometric Rank of Tensors and Subrank of Matrix Multiplication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.35">10.4230/LIPIcs.CCC.2020.35</a>
</li>
<li>
<span class="authors">Huck Bennett and Chris Peikert</span>
<span class="title">Hardness of Bounded Distance Decoding on Lattices in 𝓁_p Norms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.36">10.4230/LIPIcs.CCC.2020.36</a>
</li>
<li>
<span class="authors">Robert Andrews</span>
<span class="title">Algebraic Hardness Versus Randomness in Low Characteristic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.37">10.4230/LIPIcs.CCC.2020.37</a>
</li>
<li>
<span class="authors">Aaron Potechin</span>
<span class="title">Sum of Squares Bounds for the Ordering Principle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2020.38">10.4230/LIPIcs.CCC.2020.38</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