<h2>LIPIcs, Volume 33, CCC 2015</h2>
<ul>
<li>
<span class="authors">David Zuckerman</span>
<span class="title">LIPIcs, Volume 33, CCC'15, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015">10.4230/LIPIcs.CCC.2015</a>
</li>
<li>
<span class="authors">David Zuckerman</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.i">10.4230/LIPIcs.CCC.2015.i</a>
</li>
<li>
<span class="authors">Oded Goldreich, Tom Gur, and Ilan Komargodski</span>
<span class="title">Strong Locally Testable Codes with Relaxed Local Decoders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.1">10.4230/LIPIcs.CCC.2015.1</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami and Ameya Velingker</span>
<span class="title">An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.42">10.4230/LIPIcs.CCC.2015.42</a>
</li>
<li>
<span class="authors">Ishay Haviv and Oded Regev</span>
<span class="title">The List-Decoding Size of Fourier-Sparse Boolean Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.58">10.4230/LIPIcs.CCC.2015.58</a>
</li>
<li>
<span class="authors">Abhishek Bhowmick and Shachar Lovett</span>
<span class="title">Nonclassical Polynomials as a Barrier to Polynomial Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.72">10.4230/LIPIcs.CCC.2015.72</a>
</li>
<li>
<span class="authors">Anup Rao and Amir Yehudayoff</span>
<span class="title">Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.88">10.4230/LIPIcs.CCC.2015.88</a>
</li>
<li>
<span class="authors">Sivaramakrishnan Natarajan Ramamoorthy and Anup Rao</span>
<span class="title">How to Compress Asymmetric Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.102">10.4230/LIPIcs.CCC.2015.102</a>
</li>
<li>
<span class="authors">Igor Carboni Oliveira and Rahul Santhanam</span>
<span class="title">Majority is Incompressible by AC^0[p] Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.124">10.4230/LIPIcs.CCC.2015.124</a>
</li>
<li>
<span class="authors">Neeraj Kayal and Chandan Saha</span>
<span class="title">Lower Bounds for Depth Three Arithmetic Circuits with Small Bottom Fanin</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.158">10.4230/LIPIcs.CCC.2015.158</a>
</li>
<li>
<span class="authors">Suman K. Bera and Amit Chakrabarti</span>
<span class="title">A Depth-Five Lower Bound for Iterated Matrix Multiplication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.183">10.4230/LIPIcs.CCC.2015.183</a>
</li>
<li>
<span class="authors">Rafael Oliveira</span>
<span class="title">Factors of Low Individual Degree Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.198">10.4230/LIPIcs.CCC.2015.198</a>
</li>
<li>
<span class="authors">Amit Chakrabarti, Graham Cormode, Andrew McGregor, Justin Thaler, and Suresh Venkatasubramanian</span>
<span class="title">Verifiable Stream Computation and Arthur–Merlin Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.217">10.4230/LIPIcs.CCC.2015.217</a>
</li>
<li>
<span class="authors">Shuichi Hirahara</span>
<span class="title">Identifying an Honest EXP^NP Oracle Among Many</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.244">10.4230/LIPIcs.CCC.2015.244</a>
</li>
<li>
<span class="authors">Rocco A. Servedio, Li-Yang Tan, and John Wright</span>
<span class="title">Adaptivity Helps for Testing Juntas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.264">10.4230/LIPIcs.CCC.2015.264</a>
</li>
<li>
<span class="authors">Amey Bhangale, Prahladh Harsha, and Girish Varma</span>
<span class="title">A Characterization of Hard-to-cover CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.280">10.4230/LIPIcs.CCC.2015.280</a>
</li>
<li>
<span class="authors">Rafael Oliveira, Amir Shpilka, and Ben Lee Volk</span>
<span class="title">Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.304">10.4230/LIPIcs.CCC.2015.304</a>
</li>
<li>
<span class="authors">Rohit Gurjar, Arpita Korwar, Nitin Saxena, and Thomas Thierauf</span>
<span class="title">Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.323">10.4230/LIPIcs.CCC.2015.323</a>
</li>
<li>
<span class="authors">Alex Samorodnitsky, Ilya Shkredov, and Sergey Yekhanin</span>
<span class="title">Kolmogorov Width of Discrete Linear Spaces: an Approach to Matrix Rigidity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.347">10.4230/LIPIcs.CCC.2015.347</a>
</li>
<li>
<span class="authors">Cody D. Murray and R. Ryan Williams</span>
<span class="title">On the (Non) NP-Hardness of Computing Circuit Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.365">10.4230/LIPIcs.CCC.2015.365</a>
</li>
<li>
<span class="authors">Pavel Hrubes and Anup Rao</span>
<span class="title">Circuits with Medium Fan-In</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.381">10.4230/LIPIcs.CCC.2015.381</a>
</li>
<li>
<span class="authors">Benjamin Rossman</span>
<span class="title">Correlation Bounds Against Monotone NC^1</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.392">10.4230/LIPIcs.CCC.2015.392</a>
</li>
<li>
<span class="authors">Fu Li, Iddo Tzameret, and Zhengyu Wang</span>
<span class="title">Non-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.412">10.4230/LIPIcs.CCC.2015.412</a>
</li>
<li>
<span class="authors">Nicola Galesi, Pavel Pudlák, and Neil Thapen</span>
<span class="title">The Space Complexity of Cutting Planes Refutations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.433">10.4230/LIPIcs.CCC.2015.433</a>
</li>
<li>
<span class="authors">Massimo Lauria and Jakob Nordström</span>
<span class="title">Tight Size-Degree Bounds for Sums-of-Squares Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.448">10.4230/LIPIcs.CCC.2015.448</a>
</li>
<li>
<span class="authors">Mladen Miksa and Jakob Nordström</span>
<span class="title">A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.467">10.4230/LIPIcs.CCC.2015.467</a>
</li>
<li>
<span class="authors">Hirotada Kobayashi, Francois Le Gall, and Harumichi Nishimura</span>
<span class="title">Generalized Quantum Arthur-Merlin Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.488">10.4230/LIPIcs.CCC.2015.488</a>
</li>
<li>
<span class="authors">Kai-Min Chung, Xiaodi Wu, and Henry Yuen</span>
<span class="title">Parallel Repetition for Entangled k-player Games via Fast Quantum Search</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.512">10.4230/LIPIcs.CCC.2015.512</a>
</li>
<li>
<span class="authors">Cedric Yen-Yu Lin and Han-Hsuan Lin</span>
<span class="title">Upper Bounds on Quantum Query Complexity Inspired by the Elitzur-Vaidman Bomb Tester</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.537">10.4230/LIPIcs.CCC.2015.537</a>
</li>
<li>
<span class="authors">Daniel M. Kane</span>
<span class="title">A Polylogarithmic PRG for Degree 2 Threshold Functions in the Gaussian Setting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.567">10.4230/LIPIcs.CCC.2015.567</a>
</li>
<li>
<span class="authors">Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, and Guang Yang</span>
<span class="title">Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.582">10.4230/LIPIcs.CCC.2015.582</a>
</li>
<li>
<span class="authors">Oded Goldreich, Emanuele Viola, and Avi Wigderson</span>
<span class="title">On Randomness Extraction in AC0</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2015.601">10.4230/LIPIcs.CCC.2015.601</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