<h2>LIPIcs, Volume 102, CCC 2018</h2>
<ul>
<li>
<span class="authors">Rocco A. Servedio</span>
<span class="title">LIPIcs, Volume 102, CCC'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018">10.4230/LIPIcs.CCC.2018</a>
</li>
<li>
<span class="authors">Rocco A. Servedio</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.0">10.4230/LIPIcs.CCC.2018.0</a>
</li>
<li>
<span class="authors">Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, and Shachar Lovett</span>
<span class="title">Pseudorandom Generators from Polarizing Random Walks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.1">10.4230/LIPIcs.CCC.2018.1</a>
</li>
<li>
<span class="authors">Daniel Kane and Sankeerth Rao</span>
<span class="title">A PRG for Boolean PTF of Degree 2 with Seed Length Subpolynomial in epsilon and Logarithmic in n</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.2">10.4230/LIPIcs.CCC.2018.2</a>
</li>
<li>
<span class="authors">Avraham Ben-Aroya, Eshan Chattopadhyay, Dean Doron, Xin Li, and Amnon Ta-Shma</span>
<span class="title">A New Approach for Constructing Low-Error, Two-Source Extractors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.3">10.4230/LIPIcs.CCC.2018.3</a>
</li>
<li>
<span class="authors">Venkatesan Guruswami, Nicolas Resch, and Chaoping Xing</span>
<span class="title">Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.4">10.4230/LIPIcs.CCC.2018.4</a>
</li>
<li>
<span class="authors">Shuichi Hirahara, Igor C. Oliveira, and Rahul Santhanam</span>
<span class="title">NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.5">10.4230/LIPIcs.CCC.2018.5</a>
</li>
<li>
<span class="authors">Richard Ryan Williams</span>
<span class="title">Limits on Representing Boolean Functions by Linear Combinations of Simple Functions: Thresholds, ReLUs, and Low-Degree Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.6">10.4230/LIPIcs.CCC.2018.6</a>
</li>
<li>
<span class="authors">Russell Impagliazzo, Valentine Kabanets, and Ilya Volkovich</span>
<span class="title">The Power of Natural Properties as Oracles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.7">10.4230/LIPIcs.CCC.2018.7</a>
</li>
<li>
<span class="authors">Sampath Kannan, Elchanan Mossel, Swagato Sanyal, and Grigory Yaroslavtsev</span>
<span class="title">Linear Sketching over F_2</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.8">10.4230/LIPIcs.CCC.2018.8</a>
</li>
<li>
<span class="authors">Thomas Watson</span>
<span class="title">Communication Complexity with Small Advantage</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.9">10.4230/LIPIcs.CCC.2018.9</a>
</li>
<li>
<span class="authors">Zeyu Guo, Nitin Saxena, and Amit Sinhababu</span>
<span class="title">Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.10">10.4230/LIPIcs.CCC.2018.10</a>
</li>
<li>
<span class="authors">Noga Alon, Mrinal Kumar, and Ben Lee Volk</span>
<span class="title">Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.11">10.4230/LIPIcs.CCC.2018.11</a>
</li>
<li>
<span class="authors">Marco L. Carmosino, Russell Impagliazzo, Shachar Lovett, and Ivan Mihajlin</span>
<span class="title">Hardness Amplification for Non-Commutative Arithmetic Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.12">10.4230/LIPIcs.CCC.2018.12</a>
</li>
<li>
<span class="authors">Chi-Ning Chou, Mrinal Kumar, and Noam Solomon</span>
<span class="title">Hardness vs Randomness for Bounded Depth Arithmetic Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.13">10.4230/LIPIcs.CCC.2018.13</a>
</li>
<li>
<span class="authors">Lijie Chen</span>
<span class="title">On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.14">10.4230/LIPIcs.CCC.2018.14</a>
</li>
<li>
<span class="authors">Jeff Edmonds, Venkatesh Medabalimi, and Toniann Pitassi</span>
<span class="title">Hardness of Function Composition for Semantic Read once Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.15">10.4230/LIPIcs.CCC.2018.15</a>
</li>
<li>
<span class="authors">Sam Buss, Dmitry Itsykson, Alexander Knop, and Dmitry Sokolov</span>
<span class="title">Reordering Rule Makes OBDD Proof Systems Stronger</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.16">10.4230/LIPIcs.CCC.2018.16</a>
</li>
<li>
<span class="authors">Alessandro Chiesa, Peter Manohar, and Igor Shinkar</span>
<span class="title">Testing Linearity against Non-Signaling Strategies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.17">10.4230/LIPIcs.CCC.2018.17</a>
</li>
<li>
<span class="authors">Omri Ben-Eliezer and Eldar Fischer</span>
<span class="title">Earthmover Resilience and Testing in Ordered Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.18">10.4230/LIPIcs.CCC.2018.18</a>
</li>
<li>
<span class="authors">Daniel Grier and Luke Schaeffer</span>
<span class="title">New Hardness Results for the Permanent Using Linear Optics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.19">10.4230/LIPIcs.CCC.2018.19</a>
</li>
<li>
<span class="authors">Anand Natarajan and Thomas Vidick</span>
<span class="title">Retracted: Two-Player Entangled Games are NP-Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.20">10.4230/LIPIcs.CCC.2018.20</a>
</li>
<li>
<span class="authors">Adam Bouland, Joseph F. Fitzsimons, and Dax Enshan Koh</span>
<span class="title">Complexity Classification of Conjugated Clifford Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.21">10.4230/LIPIcs.CCC.2018.21</a>
</li>
<li>
<span class="authors">Omer Reingold, Guy N. Rothblum, and Ron D. Rothblum</span>
<span class="title">Efficient Batch Verification for UP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.22">10.4230/LIPIcs.CCC.2018.22</a>
</li>
<li>
<span class="authors">Yi-Hsiu Chen, Mika Göös, Salil P. Vadhan, and Jiapeng Zhang</span>
<span class="title">A Tight Lower Bound for Entropy Flattening</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.23">10.4230/LIPIcs.CCC.2018.23</a>
</li>
<li>
<span class="authors">Eli Ben-Sasson, Swastik Kopparty, and Shubhangi Saraf</span>
<span class="title">Worst-Case to Average Case Reductions for the Distance to a Code</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.24">10.4230/LIPIcs.CCC.2018.24</a>
</li>
<li>
<span class="authors">Lukas Fleischer</span>
<span class="title">On the Complexity of the Cayley Semigroup Membership Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.25">10.4230/LIPIcs.CCC.2018.25</a>
</li>
<li>
<span class="authors">Andrzej Lingas</span>
<span class="title">Small Normalized Boolean Circuits for Semi-disjoint Bilinear Forms Require Logarithmic Conjunction-depth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.26">10.4230/LIPIcs.CCC.2018.26</a>
</li>
<li>
<span class="authors">Sivaramakrishnan Natarajan Ramamoorthy and Anup Rao</span>
<span class="title">Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers, from Sunflowers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.27">10.4230/LIPIcs.CCC.2018.27</a>
</li>
<li>
<span class="authors">Badih Ghazi, Pritish Kamath, and Prasad Raghavendra</span>
<span class="title">Dimension Reduction for Polynomials over Gaussian Space and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CCC.2018.28">10.4230/LIPIcs.CCC.2018.28</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