<h2>LIPIcs, Volume 137, CCC 2019</h2>
<ul>
<li>
<span class="authors">Amir Shpilka</span>
<span class="title">LIPIcs, Volume 137, CCC'19, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019">10.4230/LIPIcs.CCC.2019</a>
</li>
<li>
<span class="authors">Amir Shpilka</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.0">10.4230/LIPIcs.CCC.2019.0</a>
</li>
<li>
<span class="authors">Benjamin Rossman</span>
<span class="title">Criticality of Regular Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.1">10.4230/LIPIcs.CCC.2019.1</a>
</li>
<li>
<span class="authors">Nader H. Bshouty</span>
<span class="title">Almost Optimal Distribution-Free Junta Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.2">10.4230/LIPIcs.CCC.2019.2</a>
</li>
<li>
<span class="authors">Amey Bhangale and Subhash Khot</span>
<span class="title">UG-Hardness to NP-Hardness by Losing Half</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.3">10.4230/LIPIcs.CCC.2019.3</a>
</li>
<li>
<span class="authors">Eshan Chattopadhyay, Anindya De, and Rocco A. Servedio</span>
<span class="title">Simple and Efficient Pseudorandom Generators from Gaussian Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.4">10.4230/LIPIcs.CCC.2019.4</a>
</li>
<li>
<span class="authors">Shachar Lovett, Noam Solomon, and Jiapeng Zhang</span>
<span class="title">From DNF Compression to Sunflower Theorems via Regularity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.5">10.4230/LIPIcs.CCC.2019.5</a>
</li>
<li>
<span class="authors">Stefan Dantchev, Nicola Galesi, and Barnaby Martin</span>
<span class="title">Resolution and the Binary Encoding of Combinatorial Principles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.6">10.4230/LIPIcs.CCC.2019.6</a>
</li>
<li>
<span class="authors">Chin Ho Lee</span>
<span class="title">Fourier Bounds and Pseudorandom Generators for Product Tests</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.7">10.4230/LIPIcs.CCC.2019.7</a>
</li>
<li>
<span class="authors">Ryan O'Donnell and Tselil Schramm</span>
<span class="title">Sherali - Adams Strikes Back</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.8">10.4230/LIPIcs.CCC.2019.8</a>
</li>
<li>
<span class="authors">William M. Hoza</span>
<span class="title">Typically-Correct Derandomization for Small Time and Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.9">10.4230/LIPIcs.CCC.2019.9</a>
</li>
<li>
<span class="authors">Mark Braverman, Klim Efremenko, Ran Gelles, and Michael A. Yitayew</span>
<span class="title">Optimal Short-Circuit Resilient Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.10">10.4230/LIPIcs.CCC.2019.10</a>
</li>
<li>
<span class="authors">Noah Stephens-Davidowitz</span>
<span class="title">A Time-Distance Trade-Off for GDD with Preprocessing - Instantiating the DLW Heuristic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.11">10.4230/LIPIcs.CCC.2019.11</a>
</li>
<li>
<span class="authors">Josh Alman</span>
<span class="title">Limits on the Universal Method for Matrix Multiplication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.12">10.4230/LIPIcs.CCC.2019.12</a>
</li>
<li>
<span class="authors">Kaave Hosseini, Shachar Lovett, and Grigory Yaroslavtsev</span>
<span class="title">Optimality of Linear Sketching Under Modular Updates</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.13">10.4230/LIPIcs.CCC.2019.13</a>
</li>
<li>
<span class="authors">Arkadev Chattopadhyay, Shachar Lovett, and Marc Vinyals</span>
<span class="title">Equality Alone Does not Simulate Randomness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.14">10.4230/LIPIcs.CCC.2019.14</a>
</li>
<li>
<span class="authors">Ashish Dwivedi, Rajat Mittal, and Nitin Saxena</span>
<span class="title">Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and p-Adic Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.15">10.4230/LIPIcs.CCC.2019.15</a>
</li>
<li>
<span class="authors">Dean Doron, Pooya Hatami, and William M. Hoza</span>
<span class="title">Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.16">10.4230/LIPIcs.CCC.2019.16</a>
</li>
<li>
<span class="authors">Zeev Dvir and Allen Liu</span>
<span class="title">Fourier and Circulant Matrices Are Not Rigid</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.17">10.4230/LIPIcs.CCC.2019.17</a>
</li>
<li>
<span class="authors">Susanna F. de Rezende, Jakob Nordström, Or Meir, and Robert Robere</span>
<span class="title">Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.18">10.4230/LIPIcs.CCC.2019.18</a>
</li>
<li>
<span class="authors">Lijie Chen and R. Ryan Williams</span>
<span class="title">Stronger Connections Between Circuit Analysis and Circuit Lower Bounds, via PCPs of Proximity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.19">10.4230/LIPIcs.CCC.2019.19</a>
</li>
<li>
<span class="authors">Matthew Coudron and Aram W. Harrow</span>
<span class="title">Universality of EPR Pairs in Entanglement-Assisted Communication Complexity, and the Communication Cost of State Conversion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.20">10.4230/LIPIcs.CCC.2019.20</a>
</li>
<li>
<span class="authors">François Le Gall</span>
<span class="title">Average-Case Quantum Advantage with Shallow Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.21">10.4230/LIPIcs.CCC.2019.21</a>
</li>
<li>
<span class="authors">Sumegha Garg, Ran Raz, and Avishay Tal</span>
<span class="title">Time-Space Lower Bounds for Two-Pass Learning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.22">10.4230/LIPIcs.CCC.2019.22</a>
</li>
<li>
<span class="authors">Igor Carboni Oliveira, Rahul Santhanam, and Srikanth Srinivasan</span>
<span class="title">Parity Helps to Compute Majority</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.23">10.4230/LIPIcs.CCC.2019.23</a>
</li>
<li>
<span class="authors">Albert Atserias and Tuomas Hakoniemi</span>
<span class="title">Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.24">10.4230/LIPIcs.CCC.2019.24</a>
</li>
<li>
<span class="authors">Matthew Coudron and William Slofstra</span>
<span class="title">Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High Precision</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.25">10.4230/LIPIcs.CCC.2019.25</a>
</li>
<li>
<span class="authors">Matthias Christandl, Péter Vrana, and Jeroen Zuiddam</span>
<span class="title">Barriers for Fast Matrix Multiplication from Irreversibility</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.26">10.4230/LIPIcs.CCC.2019.26</a>
</li>
<li>
<span class="authors">Igor Carboni Oliveira, Ján Pich, and Rahul Santhanam</span>
<span class="title">Hardness Magnification near State-Of-The-Art Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.27">10.4230/LIPIcs.CCC.2019.27</a>
</li>
<li>
<span class="authors">Xin Li</span>
<span class="title">Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.28">10.4230/LIPIcs.CCC.2019.28</a>
</li>
<li>
<span class="authors">Eric Blais and Joshua Brody</span>
<span class="title">Optimal Separation and Strong Direct Sum for Randomized Query Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.29">10.4230/LIPIcs.CCC.2019.29</a>
</li>
<li>
<span class="authors">Lijie Chen, Dylan M. McKay, Cody D. Murray, and R. Ryan Williams</span>
<span class="title">Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.30">10.4230/LIPIcs.CCC.2019.30</a>
</li>
<li>
<span class="authors">Karl Bringmann, Nick Fischer, and Marvin Künnemann</span>
<span class="title">A Fine-Grained Analogue of Schaefer’s Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.31">10.4230/LIPIcs.CCC.2019.31</a>
</li>
<li>
<span class="authors">Mitali Bafna and Nikhil Vyas</span>
<span class="title">Imperfect Gaps in Gap-ETH and PCPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2019.32">10.4230/LIPIcs.CCC.2019.32</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