LIPIcs, Volume 102, CCC 2018

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