LIPIcs, Volume 169, CCC 2020

• Shubhangi Saraf LIPIcs, Volume 169, CCC 2020, Complete Volume 10.4230/LIPIcs.CCC.2020
• Shubhangi Saraf Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.CCC.2020.0
• Avraham Ben-Aroya, Dean Doron, and Amnon Ta-Shma Near-Optimal Erasure List-Decodable Codes 10.4230/LIPIcs.CCC.2020.1
• Prerona Chatterjee, Mrinal Kumar, Adrian She, and Ben Lee Volk A Quadratic Lower Bound for Algebraic Branching Programs 10.4230/LIPIcs.CCC.2020.2
• Dominik Scheder and Navid Talebanfard Super Strong ETH Is True for PPSZ with Small Resolution Width 10.4230/LIPIcs.CCC.2020.3
• Jin-Yi Cai, Tianyu Liu, Pinyan Lu, and Jing Yu Approximability of the Eight-Vertex Model 10.4230/LIPIcs.CCC.2020.4
• Mrinal Kumar and Ben Lee Volk Lower Bounds for Matrix Factorization 10.4230/LIPIcs.CCC.2020.5
• Dean Doron, Pooya Hatami, and William M. Hoza Log-Seed Pseudorandom Generators via Iterated Restrictions 10.4230/LIPIcs.CCC.2020.6
• Scott Aaronson, Robin Kothari, William Kretschmer, and Justin Thaler Quantum Lower Bounds for Approximate Counting via Laurent Polynomials 10.4230/LIPIcs.CCC.2020.7
• Shir Peleg and Amir Shpilka A Generalized Sylvester-Gallai Type Theorem for Quadratic Polynomials 10.4230/LIPIcs.CCC.2020.8
• Amey Bhangale and Subhash Khot Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut 10.4230/LIPIcs.CCC.2020.9
• Kuan Cheng and William M. Hoza Hitting Sets Give Two-Sided Derandomization of Small Space 10.4230/LIPIcs.CCC.2020.10
• Gil Cohen and Shahar Samocha Palette-Alternating Tree Codes 10.4230/LIPIcs.CCC.2020.11
• Ankit Garg, Christian Ikenmeyer, Visu Makam, Rafael Oliveira, Michael Walter, and Avi Wigderson Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings 10.4230/LIPIcs.CCC.2020.12
• Matthew Coulson, Ewan Davies, Alexandra Kolla, Viresh Patel, and Guus Regts Statistical Physics Approaches to Unique Games 10.4230/LIPIcs.CCC.2020.13
• Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, and Srikanth Srinivasan Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't 10.4230/LIPIcs.CCC.2020.14
• Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, and Igor C. Oliveira Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates 10.4230/LIPIcs.CCC.2020.15
• Scott Aaronson, Nai-Hui Chia, Han-Hsuan Lin, Chunhao Wang, and Ruizhe Zhang On the Quantum Complexity of Closest Pair and Related Problems 10.4230/LIPIcs.CCC.2020.16
• Yuval Filmus, Yuval Ishai, Avi Kaplan, and Guy Kindler Limits of Preprocessing 10.4230/LIPIcs.CCC.2020.17
• Hamed Hatami, Kaave Hosseini, and Shachar Lovett Sign Rank vs Discrepancy 10.4230/LIPIcs.CCC.2020.18
• Mika Göös, Pritish Kamath, Katerina Sotiraki, and Manolis Zampetakis On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem 10.4230/LIPIcs.CCC.2020.19
• Shuichi Hirahara Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom Generator Constructions 10.4230/LIPIcs.CCC.2020.20
• Markus Bläser, Christian Ikenmeyer, Meena Mahajan, Anurag Pandey, and Nitin Saurabh Algebraic Branching Programs, Border Complexity, and Tangent Spaces 10.4230/LIPIcs.CCC.2020.21
• Rahul Ilango, Bruno Loff, and Igor C. Oliveira NP-Hardness of Circuit Minimization for Multi-Output Functions 10.4230/LIPIcs.CCC.2020.22
• Nikhil Gupta, Chandan Saha, and Bhargav Thankey A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits 10.4230/LIPIcs.CCC.2020.23
• Alexander Kozachinskiy and Vladimir Podolskii Multiparty Karchmer - Wigderson Games and Threshold Circuits 10.4230/LIPIcs.CCC.2020.24
• Eshan Chattopadhyay and Jyun-Jie Liao Optimal Error Pseudodistributions for Read-Once Branching Programs 10.4230/LIPIcs.CCC.2020.25
• Michael Saks and Rahul Santhanam Circuit Lower Bounds from NP-Hardness of MCSP Under Turing Reductions 10.4230/LIPIcs.CCC.2020.26
• Marvin Künnemann and Dániel Marx Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction 10.4230/LIPIcs.CCC.2020.27
• Susanna F. de Rezende, Jakob Nordström, Kilian Risse, and Dmitry Sokolov Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs 10.4230/LIPIcs.CCC.2020.28
• Laurent Bartholdi, Michael Figelius, Markus Lohrey, and Armin Weiß Groups with ALOGTIME-Hard Word Problems and PSPACE-Complete Circuit Value Problems 10.4230/LIPIcs.CCC.2020.29
• Jacques Dark and Christian Konrad Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams 10.4230/LIPIcs.CCC.2020.30
• Rahul Ilango Connecting Perebor Conjectures: Towards a Search to Decision Reduction for Minimizing Formulas 10.4230/LIPIcs.CCC.2020.31
• Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, and Manaswi Paraashar Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead 10.4230/LIPIcs.CCC.2020.32
• Amit Sinhababu and Thomas Thierauf Factorization of Polynomials Given By Arithmetic Branching Programs 10.4230/LIPIcs.CCC.2020.33
• Daniel Dadush and Samarth Tiwari On the Complexity of Branching Proofs 10.4230/LIPIcs.CCC.2020.34
• Swastik Kopparty, Guy Moshkovitz, and Jeroen Zuiddam Geometric Rank of Tensors and Subrank of Matrix Multiplication 10.4230/LIPIcs.CCC.2020.35
• Huck Bennett and Chris Peikert Hardness of Bounded Distance Decoding on Lattices in 𝓁_p Norms 10.4230/LIPIcs.CCC.2020.36
• Robert Andrews Algebraic Hardness Versus Randomness in Low Characteristic 10.4230/LIPIcs.CCC.2020.37
• Aaron Potechin Sum of Squares Bounds for the Ordering Principle 10.4230/LIPIcs.CCC.2020.38