LIPIcs, Volume 79, CCC 2017

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