<h2>LIPIcs, Volume 50, CCC 2016</h2>
<ul>
<li>
<span class="authors">Ran Raz</span>
<span class="title">LIPIcs, Volume 50, CCC'16, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016">10.4230/LIPIcs.CCC.2016</a>
</li>
<li>
<span class="authors">Ran Raz</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.2016.0">10.4230/LIPIcs.CCC.2016.0</a>
</li>
<li>
<span class="authors">Ruiwen Chen, Rahul Santhanam, and Srikanth Srinivasan</span>
<span class="title">Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.1">10.4230/LIPIcs.CCC.2016.1</a>
</li>
<li>
<span class="authors">Richard Ryan Williams</span>
<span class="title">Strong ETH Breaks With Merlin and Arthur: Short Non-Interactive Proofs of Batch Evaluation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.2">10.4230/LIPIcs.CCC.2016.2</a>
</li>
<li>
<span class="authors">Irit Dinur and Or Meir</span>
<span class="title">Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.3">10.4230/LIPIcs.CCC.2016.3</a>
</li>
<li>
<span class="authors">Andris Ambainis, Martins Kokainis, and Robin Kothari</span>
<span class="title">Nearly Optimal Separations Between Communication (or Query) Complexity and Partitions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.4">10.4230/LIPIcs.CCC.2016.4</a>
</li>
<li>
<span class="authors">Mika Göös and T. S. Jayram</span>
<span class="title">A Composition Theorem for Conical Juntas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.5">10.4230/LIPIcs.CCC.2016.5</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami and Jaikumar Radhakrishnan</span>
<span class="title">Tight Bounds for Communication-Assisted Agreement Distillation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.6">10.4230/LIPIcs.CCC.2016.6</a>
</li>
<li>
<span class="authors">Eshan Chattopadhyay and David Zuckerman</span>
<span class="title">New Extractors for Interleaved Sources</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.7">10.4230/LIPIcs.CCC.2016.7</a>
</li>
<li>
<span class="authors">Gil Cohen</span>
<span class="title">Non-Malleable Extractors - New Tools and Improved Constructions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.8">10.4230/LIPIcs.CCC.2016.8</a>
</li>
<li>
<span class="authors">Sergei Artemenko, Russell Impagliazzo, Valentine Kabanets, and Ronen Shaltiel</span>
<span class="title">Pseudorandomness When the Odds are Against You</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.9">10.4230/LIPIcs.CCC.2016.9</a>
</li>
<li>
<span class="authors">Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, and Antonina Kolokolova</span>
<span class="title">Learning Algorithms from Natural Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.10">10.4230/LIPIcs.CCC.2016.10</a>
</li>
<li>
<span class="authors">John Y. Kim and Swastik Kopparty</span>
<span class="title">Decoding Reed-Muller Codes Over Product Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.11">10.4230/LIPIcs.CCC.2016.11</a>
</li>
<li>
<span class="authors">Arnab Bhattacharyya and Sivakanth Gopi</span>
<span class="title">Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.12">10.4230/LIPIcs.CCC.2016.12</a>
</li>
<li>
<span class="authors">Parikshit Gopalan, Rocco A. Servedio, and Avi Wigderson</span>
<span class="title">Degree and Sensitivity: Tails of Two Distributions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.13">10.4230/LIPIcs.CCC.2016.13</a>
</li>
<li>
<span class="authors">Joshua Brakensiek and Venkatesan Guruswami</span>
<span class="title">New Hardness Results for Graph and Hypergraph Colorings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.14">10.4230/LIPIcs.CCC.2016.14</a>
</li>
<li>
<span class="authors">Yuval Filmus, Guy Kindler, Elchanan Mossel, and Karl Wimmer</span>
<span class="title">Invariance Principle on the Slice</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.15">10.4230/LIPIcs.CCC.2016.15</a>
</li>
<li>
<span class="authors">Yuval Filmus and Elchanan Mossel</span>
<span class="title">Harmonicity and Invariance on Slices of the Boolean Cube</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.16">10.4230/LIPIcs.CCC.2016.16</a>
</li>
<li>
<span class="authors">Troy Lee, Anupam Prakash, Ronald de Wolf, and Henry Yuen</span>
<span class="title">On the Sum-of-Squares Degree of Symmetric Quadratic Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.17">10.4230/LIPIcs.CCC.2016.17</a>
</li>
<li>
<span class="authors">Shuichi Hirahara and Osamu Watanabe</span>
<span class="title">Limits of Minimum Circuit Size Problem as Oracle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.18">10.4230/LIPIcs.CCC.2016.18</a>
</li>
<li>
<span class="authors">Lance Fortnow and Rahul Santhanam</span>
<span class="title">New Non-Uniform Lower Bounds for Uniform Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.19">10.4230/LIPIcs.CCC.2016.19</a>
</li>
<li>
<span class="authors">Yuqing Ai, Wei Hu, Yi Li, and David P. Woodruff</span>
<span class="title">New Characterizations in Turnstile Streams with Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.20">10.4230/LIPIcs.CCC.2016.20</a>
</li>
<li>
<span class="authors">Nisheeth K. Vishnoi</span>
<span class="title">Evolution and Computation (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.21">10.4230/LIPIcs.CCC.2016.21</a>
</li>
<li>
<span class="authors">Aram Harrow, Anand V. Natarajan, and Xiaodi Wu</span>
<span class="title">Tight SoS-Degree Bounds for Approximate Nash Equilibria</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.22">10.4230/LIPIcs.CCC.2016.22</a>
</li>
<li>
<span class="authors">Xiaotie Deng, Jack R. Edmonds, Zhe Feng, Zhengyang Liu, Qi Qi, and Zeying Xu</span>
<span class="title">Understanding PPA-Completeness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.23">10.4230/LIPIcs.CCC.2016.23</a>
</li>
<li>
<span class="authors">Ryan O'Donnell and Yu Zhao</span>
<span class="title">Polynomial Bounds for Decoupling, with Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.24">10.4230/LIPIcs.CCC.2016.24</a>
</li>
<li>
<span class="authors">Scott Aaronson, Andris Ambainis, Janis Iraids, Martins Kokainis, and Juris Smotrovs</span>
<span class="title">Polynomials, Quantum Query Complexity, and Grothendieck's Inequality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.25">10.4230/LIPIcs.CCC.2016.25</a>
</li>
<li>
<span class="authors">Scott Aaronson and Shalev Ben-David</span>
<span class="title">Sculpting Quantum Speedups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.26">10.4230/LIPIcs.CCC.2016.26</a>
</li>
<li>
<span class="authors">Niel de Beaudrap and Sevag Gharibian</span>
<span class="title">A Linear Time Algorithm for Quantum 2-SAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.27">10.4230/LIPIcs.CCC.2016.27</a>
</li>
<li>
<span class="authors">Adam Bouland, Laura Mancinska, and Xue Zhang</span>
<span class="title">Complexity Classification of Two-Qubit Commuting Hamiltonians</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.28">10.4230/LIPIcs.CCC.2016.28</a>
</li>
<li>
<span class="authors">Rohit Gurjar, Arpita Korwar, and Nitin Saxena</span>
<span class="title">Identity Testing for Constant-Width, and Commutative, Read-Once Oblivious ABPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.29">10.4230/LIPIcs.CCC.2016.29</a>
</li>
<li>
<span class="authors">Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, and Ben Lee Volk</span>
<span class="title">Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.30">10.4230/LIPIcs.CCC.2016.30</a>
</li>
<li>
<span class="authors">Gaurav Sinha</span>
<span class="title">Reconstruction of Real Depth-3 Circuits with Top Fan-In 2</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.31">10.4230/LIPIcs.CCC.2016.31</a>
</li>
<li>
<span class="authors">Michael A. Forbes, Amir Shpilka, Iddo Tzameret, and Avi Wigderson</span>
<span class="title">Proof Complexity Lower Bounds from Algebraic Circuit Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.32">10.4230/LIPIcs.CCC.2016.32</a>
</li>
<li>
<span class="authors">Michael A. Forbes, Mrinal Kumar, and Ramprasad Saptharishi</span>
<span class="title">Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.33">10.4230/LIPIcs.CCC.2016.33</a>
</li>
<li>
<span class="authors">Mrinal Kumar and Shubhangi Saraf</span>
<span class="title">Arithmetic Circuits with Locally Low Algebraic Rank</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.34">10.4230/LIPIcs.CCC.2016.34</a>
</li>
<li>
<span class="authors">Mrinal Kumar and Shubhangi Saraf</span>
<span class="title">Sums of Products of Polynomials in Few Variables: Lower Bounds and Polynomial Identity Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2016.35">10.4230/LIPIcs.CCC.2016.35</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