LIPIcs, Volume 137, CCC 2019

• Amir Shpilka LIPIcs, Volume 137, CCC'19, Complete Volume 10.4230/LIPIcs.CCC.2019
• Amir Shpilka Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.CCC.2019.0
• Benjamin Rossman Criticality of Regular Formulas 10.4230/LIPIcs.CCC.2019.1
• Nader H. Bshouty Almost Optimal Distribution-Free Junta Testing 10.4230/LIPIcs.CCC.2019.2
• Amey Bhangale and Subhash Khot UG-Hardness to NP-Hardness by Losing Half 10.4230/LIPIcs.CCC.2019.3
• Eshan Chattopadhyay, Anindya De, and Rocco A. Servedio Simple and Efficient Pseudorandom Generators from Gaussian Processes 10.4230/LIPIcs.CCC.2019.4
• Shachar Lovett, Noam Solomon, and Jiapeng Zhang From DNF Compression to Sunflower Theorems via Regularity 10.4230/LIPIcs.CCC.2019.5
• Stefan Dantchev, Nicola Galesi, and Barnaby Martin Resolution and the Binary Encoding of Combinatorial Principles 10.4230/LIPIcs.CCC.2019.6
• Chin Ho Lee Fourier Bounds and Pseudorandom Generators for Product Tests 10.4230/LIPIcs.CCC.2019.7
• Ryan O'Donnell and Tselil Schramm Sherali - Adams Strikes Back 10.4230/LIPIcs.CCC.2019.8
• William M. Hoza Typically-Correct Derandomization for Small Time and Space 10.4230/LIPIcs.CCC.2019.9
• Mark Braverman, Klim Efremenko, Ran Gelles, and Michael A. Yitayew Optimal Short-Circuit Resilient Formulas 10.4230/LIPIcs.CCC.2019.10
• Noah Stephens-Davidowitz A Time-Distance Trade-Off for GDD with Preprocessing - Instantiating the DLW Heuristic 10.4230/LIPIcs.CCC.2019.11
• Josh Alman Limits on the Universal Method for Matrix Multiplication 10.4230/LIPIcs.CCC.2019.12
• Kaave Hosseini, Shachar Lovett, and Grigory Yaroslavtsev Optimality of Linear Sketching Under Modular Updates 10.4230/LIPIcs.CCC.2019.13
• Arkadev Chattopadhyay, Shachar Lovett, and Marc Vinyals Equality Alone Does not Simulate Randomness 10.4230/LIPIcs.CCC.2019.14
• Ashish Dwivedi, Rajat Mittal, and Nitin Saxena Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and p-Adic Applications 10.4230/LIPIcs.CCC.2019.15
• Dean Doron, Pooya Hatami, and William M. Hoza Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas 10.4230/LIPIcs.CCC.2019.16
• Zeev Dvir and Allen Liu Fourier and Circulant Matrices Are Not Rigid 10.4230/LIPIcs.CCC.2019.17
• Susanna F. de Rezende, Jakob Nordström, Or Meir, and Robert Robere Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling 10.4230/LIPIcs.CCC.2019.18
• Lijie Chen and R. Ryan Williams Stronger Connections Between Circuit Analysis and Circuit Lower Bounds, via PCPs of Proximity 10.4230/LIPIcs.CCC.2019.19
• Matthew Coudron and Aram W. Harrow Universality of EPR Pairs in Entanglement-Assisted Communication Complexity, and the Communication Cost of State Conversion 10.4230/LIPIcs.CCC.2019.20
• François Le Gall Average-Case Quantum Advantage with Shallow Circuits 10.4230/LIPIcs.CCC.2019.21
• Sumegha Garg, Ran Raz, and Avishay Tal Time-Space Lower Bounds for Two-Pass Learning 10.4230/LIPIcs.CCC.2019.22
• Igor Carboni Oliveira, Rahul Santhanam, and Srikanth Srinivasan Parity Helps to Compute Majority 10.4230/LIPIcs.CCC.2019.23
• Albert Atserias and Tuomas Hakoniemi Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz Proofs 10.4230/LIPIcs.CCC.2019.24
• Matthew Coudron and William Slofstra Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High Precision 10.4230/LIPIcs.CCC.2019.25
• Matthias Christandl, Péter Vrana, and Jeroen Zuiddam Barriers for Fast Matrix Multiplication from Irreversibility 10.4230/LIPIcs.CCC.2019.26
• Igor Carboni Oliveira, Ján Pich, and Rahul Santhanam Hardness Magnification near State-Of-The-Art Lower Bounds 10.4230/LIPIcs.CCC.2019.27
• Xin Li Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions 10.4230/LIPIcs.CCC.2019.28
• Eric Blais and Joshua Brody Optimal Separation and Strong Direct Sum for Randomized Query Complexity 10.4230/LIPIcs.CCC.2019.29
• Lijie Chen, Dylan M. McKay, Cody D. Murray, and R. Ryan Williams Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems 10.4230/LIPIcs.CCC.2019.30
• Karl Bringmann, Nick Fischer, and Marvin Künnemann A Fine-Grained Analogue of Schaefer’s Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties 10.4230/LIPIcs.CCC.2019.31
• Mitali Bafna and Nikhil Vyas Imperfect Gaps in Gap-ETH and PCPs 10.4230/LIPIcs.CCC.2019.32