LIPIcs, Volume 200, CCC 2021

• Valentine Kabanets LIPIcs, Volume 200, CCC 2021, Complete Volume 10.4230/LIPIcs.CCC.2021
• Valentine Kabanets Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.CCC.2021.0
• Gil Cohen and Tal Yankovitz Rate Amplification and Query-Efficient Distance Amplification for Linear LCC and LDC 10.4230/LIPIcs.CCC.2021.1
• Nati Linial and Adi Shraibman An Improved Protocol for the Exactly-N Problem 10.4230/LIPIcs.CCC.2021.2
• Dmitry Itsykson and Artur Riazanov Proof Complexity of Natural Formulas via Communication Arguments 10.4230/LIPIcs.CCC.2021.3
• Mrinal Kumar and Ben Lee Volk A Lower Bound on Determinantal Complexity 10.4230/LIPIcs.CCC.2021.4
• Mark Braverman and Dor Minzer Optimal Tiling of the Euclidean Space Using Permutation-Symmetric Bodies 10.4230/LIPIcs.CCC.2021.5
• Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, and Avi Wigderson On the Power and Limitations of Branch and Cut 10.4230/LIPIcs.CCC.2021.6
• Prerona Chatterjee Separating ABPs and Some Structured Formulas in the Non-Commutative Setting 10.4230/LIPIcs.CCC.2021.7
• Alexander Golovnev and Ishay Haviv The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications 10.4230/LIPIcs.CCC.2021.8
• Pavel Hrubeš and Amir Yehudayoff Shadows of Newton Polytopes 10.4230/LIPIcs.CCC.2021.9
• Eshan Chattopadhyay, Jason Gaitonde, Chin Ho Lee, Shachar Lovett, and Abhishek Shetty Fractional Pseudorandom Generators from Any Fourier Level 10.4230/LIPIcs.CCC.2021.10
• Pranjal Dutta, Prateek Dwivedi, and Nitin Saxena Deterministic Identity Testing Paradigms for Bounded Top-Fanin Depth-4 Circuits 10.4230/LIPIcs.CCC.2021.11
• Oded Goldreich and Avi Wigderson Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing 10.4230/LIPIcs.CCC.2021.12
• W. Cole Franks and Philipp Reichenbach Barriers for Recent Methods in Geodesic Optimization 10.4230/LIPIcs.CCC.2021.13
• Marshall Ball, Oded Goldreich, and Tal Malkin Communication Complexity with Defective Randomness 10.4230/LIPIcs.CCC.2021.14
• Troy Lee, Tongyang Li, Miklos Santha, and Shengyu Zhang On the Cut Dimension of a Graph 10.4230/LIPIcs.CCC.2021.15
• Joshua A. Grochow and Youming Qiao On p-Group Isomorphism: Search-To-Decision, Counting-To-Decision, and Nilpotency Class Reductions via Tensors 10.4230/LIPIcs.CCC.2021.16
• Anastasia Sofronova and Dmitry Sokolov Branching Programs with Bounded Repetitions and Flow Formulas 10.4230/LIPIcs.CCC.2021.17
• Mika Göös and Gilbert Maystre A Majority Lemma for Randomised Query Complexity 10.4230/LIPIcs.CCC.2021.18
• Dori Medini and Amir Shpilka Hitting Sets and Reconstruction for Dense Orbits in VP_{e} and ΣΠΣ Circuits 10.4230/LIPIcs.CCC.2021.19
• Zeyu Guo Variety Evasive Subspace Families 10.4230/LIPIcs.CCC.2021.20
• Yaroslav Alekseev A Lower Bound for Polynomial Calculus with Extension Rule 10.4230/LIPIcs.CCC.2021.21
• Gil Cohen, Dean Doron, Oren Renard, Ori Sberlo, and Amnon Ta-Shma Error Reduction for Weighted PRGs Against Read Once Branching Programs 10.4230/LIPIcs.CCC.2021.22
• Pravesh K. Kothari and Peter Manohar A Stress-Free Sum-Of-Squares Lower Bound for Coloring 10.4230/LIPIcs.CCC.2021.23
• Vishnu Iyer, Avishay Tal, and Michael Whitmeyer Junta Distance Approximation with Sub-Exponential Queries 10.4230/LIPIcs.CCC.2021.24
• Pranjal Dutta, Gorav Jindal, Anurag Pandey, and Amit Sinhababu Arithmetic Circuit Complexity of Division and Truncation 10.4230/LIPIcs.CCC.2021.25
• Shuo Pang SOS Lower Bound for Exact Planted Clique 10.4230/LIPIcs.CCC.2021.26
• Rahul Jain and Srijita Kundu A Direct Product Theorem for One-Way Quantum Communication 10.4230/LIPIcs.CCC.2021.27
• Simon Apers and Troy Lee Quantum Complexity of Minimum Cut 10.4230/LIPIcs.CCC.2021.28
• Markus Bläser, Julian Dörfler, and Christian Ikenmeyer On the Complexity of Evaluating Highest Weight Vectors 10.4230/LIPIcs.CCC.2021.29
• Anurag Anshu, Shalev Ben-David, and Srijita Kundu On Query-To-Communication Lifting for Adversary Bounds 10.4230/LIPIcs.CCC.2021.30
• Shuichi Hirahara, Rahul Ilango, and Bruno Loff Hardness of Constant-Round Communication Complexity 10.4230/LIPIcs.CCC.2021.31
• Peter Bürgisser, M. Levent Doğan, Visu Makam, Michael Walter, and Avi Wigderson Polynomial Time Algorithms in Invariant Theory for Torus Actions 10.4230/LIPIcs.CCC.2021.32
• Edward Pyne and Salil Vadhan Pseudodistributions That Beat All Pseudorandom Generators (Extended Abstract) 10.4230/LIPIcs.CCC.2021.33
• Isolde Adler, Noleen Köhler, and Pan Peng GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing 10.4230/LIPIcs.CCC.2021.34
• Hanlin Ren and Rahul Santhanam Hardness of KT Characterizes Parallel Cryptography 10.4230/LIPIcs.CCC.2021.35
• Shafi Goldwasser, Russell Impagliazzo, Toniann Pitassi, and Rahul Santhanam On the Pseudo-Deterministic Query Complexity of NP Search Problems 10.4230/LIPIcs.CCC.2021.36
• Akshay Kamath, Eric Price, and David P. Woodruff A Simple Proof of a New Set Disjointness with Applications to Data Streams 10.4230/LIPIcs.CCC.2021.37
• Ivan Mihajlin and Alexander Smal Toward Better Depth Lower Bounds: The XOR-KRW Conjecture 10.4230/LIPIcs.CCC.2021.38
• Uma Girish, Avishay Tal, and Kewen Wu Fourier Growth of Parity Decision Trees 10.4230/LIPIcs.CCC.2021.39
• Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, and Dmitry Sokolov The Power of Negative Reasoning 10.4230/LIPIcs.CCC.2021.40
• László Babai and Bohdan Kivva Matrix Rigidity Depends on the Target Field 10.4230/LIPIcs.CCC.2021.41