<h2>LIPIcs, Volume 79, CCC 2017</h2>
<ul>
<li>
<span class="authors">Ryan O'Donnell</span>
<span class="title">LIPIcs, Volume 79, CCC'17, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017">10.4230/LIPIcs.CCC.2017</a>
</li>
<li>
<span class="authors">Ryan O'Donnell</span>
<span class="title">Front Matter, Table of Contents, Preface, Awards, Conference Organization, External Reviewers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.0">10.4230/LIPIcs.CCC.2017.0</a>
</li>
<li>
<span class="authors">Pavel Pudlák and Neil Thapen</span>
<span class="title">Random Resolution Refutations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.1">10.4230/LIPIcs.CCC.2017.1</a>
</li>
<li>
<span class="authors">Massimo Lauria and Jakob Nordström</span>
<span class="title">Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.2">10.4230/LIPIcs.CCC.2017.2</a>
</li>
<li>
<span class="authors">Mateus de Oliveira Oliveira and Pavel Pudlák</span>
<span class="title">Representations of Monotone Boolean Functions by Linear Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.3">10.4230/LIPIcs.CCC.2017.3</a>
</li>
<li>
<span class="authors">Aaron Potechin</span>
<span class="title">A Note on Amortized Branching Program Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.4">10.4230/LIPIcs.CCC.2017.4</a>
</li>
<li>
<span class="authors">Dieter van Melkebeek and Gautam Prakriya</span>
<span class="title">Derandomizing Isolation in Space-Bounded Settings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.5">10.4230/LIPIcs.CCC.2017.5</a>
</li>
<li>
<span class="authors">Danny Nguyen and Igor Pak</span>
<span class="title">The Computational Complexity of Integer Programming with Alternations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.6">10.4230/LIPIcs.CCC.2017.6</a>
</li>
<li>
<span class="authors">Shuichi Hirahara and Rahul Santhanam</span>
<span class="title">On the Average-Case Complexity of MCSP and Its Variants</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.7">10.4230/LIPIcs.CCC.2017.7</a>
</li>
<li>
<span class="authors">Cody D. Murray and R. Ryan Williams</span>
<span class="title">Easiness Amplification and Uniform Circuit Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.8">10.4230/LIPIcs.CCC.2017.8</a>
</li>
<li>
<span class="authors">Dominik Scheder and John P. Steinberger</span>
<span class="title">PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.9">10.4230/LIPIcs.CCC.2017.9</a>
</li>
<li>
<span class="authors">Anindya De, Elchanan Mossel, and Joe Neeman</span>
<span class="title">Noise Stability Is Computable and Approximately Low-Dimensional</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.10">10.4230/LIPIcs.CCC.2017.10</a>
</li>
<li>
<span class="authors">Mrinalkanti Ghosh and Madhur Tulsiani</span>
<span class="title">From Weak to Strong LP Gaps for All CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.11">10.4230/LIPIcs.CCC.2017.11</a>
</li>
<li>
<span class="authors">Mika Göös, Pritish Kamath, Toniann Pitassi, and Thomas Watson</span>
<span class="title">Query-to-Communication Lifting for P^NP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.12">10.4230/LIPIcs.CCC.2017.12</a>
</li>
<li>
<span class="authors">Roei Tell</span>
<span class="title">Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.13">10.4230/LIPIcs.CCC.2017.13</a>
</li>
<li>
<span class="authors">Elad Haramaty, Chin Ho Lee, and Emanuele Viola</span>
<span class="title">Bounded Independence Plus Noise Fools Products</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.14">10.4230/LIPIcs.CCC.2017.14</a>
</li>
<li>
<span class="authors">Avishay Tal</span>
<span class="title">Tight Bounds on the Fourier Spectrum of AC0</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.15">10.4230/LIPIcs.CCC.2017.15</a>
</li>
<li>
<span class="authors">Yuval Dagan, Yuval Filmus, Hamed Hatami, and Yaqiao Li</span>
<span class="title">Trading Information Complexity for Error</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.16">10.4230/LIPIcs.CCC.2017.16</a>
</li>
<li>
<span class="authors">Alexey Milovanov and Nikolay Vereshchagin</span>
<span class="title">Stochasticity in Algorithmic Statistics for Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.17">10.4230/LIPIcs.CCC.2017.17</a>
</li>
<li>
<span class="authors">Igor C. Carboni Oliveira and Rahul Santhanam</span>
<span class="title">Conspiracies Between Learning Algorithms, Circuit Lower Bounds, and Pseudorandomness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.18">10.4230/LIPIcs.CCC.2017.18</a>
</li>
<li>
<span class="authors">Mrinal Kumar</span>
<span class="title">A Quadratic Lower Bound for Homogeneous Algebraic Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.19">10.4230/LIPIcs.CCC.2017.19</a>
</li>
<li>
<span class="authors">Karl Bringmann, Christian Ikenmeyer, and Jeroen Zuiddam</span>
<span class="title">On Algebraic Branching Programs of Small Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.20">10.4230/LIPIcs.CCC.2017.20</a>
</li>
<li>
<span class="authors">Neeraj Kayal, Vineet Nair, Chandan Saha, and Sébastien Tavenas</span>
<span class="title">Reconstruction of Full Rank Algebraic Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.21">10.4230/LIPIcs.CCC.2017.21</a>
</li>
<li>
<span class="authors">Scott Aaronson and Lijie Chen</span>
<span class="title">Complexity-Theoretic Foundations of Quantum Supremacy Experiments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.22">10.4230/LIPIcs.CCC.2017.22</a>
</li>
<li>
<span class="authors">Ashwin Nayak and Dave Touchette</span>
<span class="title">Augmented Index and Quantum Streaming Algorithms for DYCK(2)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.23">10.4230/LIPIcs.CCC.2017.23</a>
</li>
<li>
<span class="authors">Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, and Troy Lee</span>
<span class="title">Separating Quantum Communication and Approximate Rank</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.24">10.4230/LIPIcs.CCC.2017.24</a>
</li>
<li>
<span class="authors">Srinivasan Arunachalam and Ronald de Wolf</span>
<span class="title">Optimal Quantum Sample Complexity of Learning Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.25">10.4230/LIPIcs.CCC.2017.25</a>
</li>
<li>
<span class="authors">Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, and Jinyu Xie</span>
<span class="title">Settling the Query Complexity of Non-Adaptive Junta Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.26">10.4230/LIPIcs.CCC.2017.26</a>
</li>
<li>
<span class="authors">Clément L. Canonne and Tom Gur</span>
<span class="title">An Adaptivity Hierarchy Theorem for Property Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.27">10.4230/LIPIcs.CCC.2017.27</a>
</li>
<li>
<span class="authors">Eric Blais, Clément L. Canonne, and Tom Gur</span>
<span class="title">Distribution Testing Lower Bounds via Reductions from Communication Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.28">10.4230/LIPIcs.CCC.2017.28</a>
</li>
<li>
<span class="authors">Irit Dinur and Inbal Livni Navon</span>
<span class="title">Exponentially Small Soundness for the Direct Product Z-Test</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.29">10.4230/LIPIcs.CCC.2017.29</a>
</li>
<li>
<span class="authors">Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, and Siyi Yang</span>
<span class="title">On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.30">10.4230/LIPIcs.CCC.2017.30</a>
</li>
<li>
<span class="authors">Mrinal Kumar and Ramprasad Saptharishi</span>
<span class="title">An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite Fields</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.31">10.4230/LIPIcs.CCC.2017.31</a>
</li>
<li>
<span class="authors">Daniel Minahan and Ilya Volkovich</span>
<span class="title">Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.32">10.4230/LIPIcs.CCC.2017.32</a>
</li>
<li>
<span class="authors">Markus Blaeser, Gorav Jindal, and Anurag Pandey</span>
<span class="title">Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2017.33">10.4230/LIPIcs.CCC.2017.33</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