LIPIcs, Volume 234, CCC 2022

• Shachar Lovett LIPIcs, Volume 234, CCC 2022, Complete Volume 10.4230/LIPIcs.CCC.2022
• Shachar Lovett Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.CCC.2022.0
• Gal Beniamini The Approximate Degree of Bipartite Perfect Matching 10.4230/LIPIcs.CCC.2022.1
• Till Tantau On the Satisfaction Probability of k-CNF Formulas 10.4230/LIPIcs.CCC.2022.2
• Andrej Bogdanov, William M. Hoza, Gautam Prakriya, and Edward Pyne Hitting Sets for Regular Branching Programs 10.4230/LIPIcs.CCC.2022.3
• Svyatoslav Gryaznov, Pavel Pudlák, and Navid Talebanfard Linear Branching Programs and Directional Affine Extractors 10.4230/LIPIcs.CCC.2022.4
• Sandy Irani, Anand Natarajan, Chinmay Nirkhe, Sujit Rao, and Henry Yuen Quantum Search-To-Decision Reductions and the State Synthesis Problem 10.4230/LIPIcs.CCC.2022.5
• Karthik C. S. and Subhash Khot Almost Polynomial Factor Inapproximability for Parameterized k-Clique 10.4230/LIPIcs.CCC.2022.6
• Venkatesan Guruswami, Peter Manohar, and Jonathan Mosheiff 𝓁_p-Spread and Restricted Isometry Properties of Sparse Random Matrices 10.4230/LIPIcs.CCC.2022.7
• James Cook and Ian Mertz Trading Time and Space in Catalytic Branching Programs 10.4230/LIPIcs.CCC.2022.8
• Harm Derksen, Visu Makam, and Jeroen Zuiddam Subrank and Optimal Reduction of Scalar Multiplications to Generic Tensors 10.4230/LIPIcs.CCC.2022.9
• Guy Blanc and Dean Doron New Near-Linear Time Decodable Codes Closer to the GV Bound 10.4230/LIPIcs.CCC.2022.10
• Jun-Ting Hsieh, Sidhanth Mohanty, and Jeff Xu Certifying Solution Geometry in Random CSPs: Counts, Clusters and Balance 10.4230/LIPIcs.CCC.2022.11
• Vikraman Arvind and Pushkar S. Joglekar On Efficient Noncommutative Polynomial Factorization via Higman Linearization 10.4230/LIPIcs.CCC.2022.12
• Ivan Mihajlin and Anastasia Sofronova A Better-Than-3log(n) Depth Lower Bound for De Morgan Formulas with Restrictions on Top Gates 10.4230/LIPIcs.CCC.2022.13
• Dan Karliner, Roie Salama, and Amnon Ta-Shma The Plane Test Is a Local Tester for Multiplicity Codes 10.4230/LIPIcs.CCC.2022.14
• Dmitry Sokolov Pseudorandom Generators, Resolution and Heavy Width 10.4230/LIPIcs.CCC.2022.15
• Halley Goldberg, Valentine Kabanets, Zhenjian Lu, and Igor C. Oliveira Probabilistic Kolmogorov Complexity with Applications to Average-Case Complexity 10.4230/LIPIcs.CCC.2022.16
• Erfan Khaniki Nisan-Wigderson Generators in Proof Complexity: New Lower Bounds 10.4230/LIPIcs.CCC.2022.17
• Ryan O'Donnell and Kevin Pratt High-Dimensional Expanders from Chevalley Groups 10.4230/LIPIcs.CCC.2022.18
• Victor Lecomte, Prasanna Ramakrishnan, and Li-Yang Tan The Composition Complexity of Majority 10.4230/LIPIcs.CCC.2022.19
• Scott Aaronson, DeVon Ingram, and William Kretschmer The Acrobatics of BQP 10.4230/LIPIcs.CCC.2022.20
• Zander Kelley and Raghu Meka Random Restrictions and PRGs for PTFs in Gaussian Space 10.4230/LIPIcs.CCC.2022.21
• Amol Aggarwal and Josh Alman Optimal-Degree Polynomial Approximations for Exponentials and Gaussian Kernel Density Estimation 10.4230/LIPIcs.CCC.2022.22
• Lijie Chen, Jiatu Li, and Tianqi Yang Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs 10.4230/LIPIcs.CCC.2022.23
• Gal Arnon, Alessandro Chiesa, and Eylon Yogev Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs 10.4230/LIPIcs.CCC.2022.24
• Shuichi Hirahara and Mikito Nanashima Finding Errorless Pessiland in Error-Prone Heuristica 10.4230/LIPIcs.CCC.2022.25
• Shuichi Hirahara Symmetry of Information from Meta-Complexity 10.4230/LIPIcs.CCC.2022.26
• Louis Golowich and Salil Vadhan Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs 10.4230/LIPIcs.CCC.2022.27
• Nikhil Bansal, Makrand Sinha, and Ronald de Wolf Influence in Completely Bounded Block-Multilinear Forms and Classical Simulation of Quantum Algorithms 10.4230/LIPIcs.CCC.2022.28
• Michael Saks and Rahul Santhanam On Randomized Reductions to the Random Strings 10.4230/LIPIcs.CCC.2022.29
• Sarah Bordage, Mathieu Lhotel, Jade Nardi, and Hugues Randriam Interactive Oracle Proofs of Proximity to Algebraic Geometry Codes 10.4230/LIPIcs.CCC.2022.30
• Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, and Srikanth Srinivasan Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes 10.4230/LIPIcs.CCC.2022.31
• Nutan Limaye, Srikanth Srinivasan, and Sébastien Tavenas On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials 10.4230/LIPIcs.CCC.2022.32
• Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, and Ran Tao Further Collapses in TFNP 10.4230/LIPIcs.CCC.2022.33
• Xin Lyu Improved Pseudorandom Generators for AC⁰ Circuits 10.4230/LIPIcs.CCC.2022.34
• Yanyi Liu and Rafael Pass Characterizing Derandomization Through Hardness of Levin-Kolmogorov Complexity 10.4230/LIPIcs.CCC.2022.35
• Yanyi Liu and Rafael Pass On One-Way Functions from NP-Complete Problems 10.4230/LIPIcs.CCC.2022.36
• Oliver Korten Derandomization from Time-Space Tradeoffs 10.4230/LIPIcs.CCC.2022.37
• Deepanshu Kush and Shubhangi Saraf Improved Low-Depth Set-Multilinear Circuit Lower Bounds 10.4230/LIPIcs.CCC.2022.38