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