@Proceedings{lovett:LIPIcs.CCC.2022,
title = {{LIPIcs, Volume 234, CCC 2022, Complete Volume}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {1--960},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022},
URN = {urn:nbn:de:0030-drops-165614},
doi = {10.4230/LIPIcs.CCC.2022},
annote = {Keywords: LIPIcs, Volume 234, CCC 2022, Complete Volume}
}
@InProceedings{lovett:LIPIcs.CCC.2022.0,
author = {Lovett, Shachar},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.0},
URN = {urn:nbn:de:0030-drops-165621},
doi = {10.4230/LIPIcs.CCC.2022.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{beniamini:LIPIcs.CCC.2022.1,
author = {Beniamini, Gal},
title = {{The Approximate Degree of Bipartite Perfect Matching}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {1:1--1:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.1},
URN = {urn:nbn:de:0030-drops-165634},
doi = {10.4230/LIPIcs.CCC.2022.1},
annote = {Keywords: Bipartite Perfect Matching, Boolean Functions, Approximate Degree}
}
@InProceedings{tantau:LIPIcs.CCC.2022.2,
author = {Tantau, Till},
title = {{On the Satisfaction Probability of k-CNF Formulas}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {2:1--2:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.2},
URN = {urn:nbn:de:0030-drops-165648},
doi = {10.4230/LIPIcs.CCC.2022.2},
annote = {Keywords: Satisfaction probability, majority it\{k\}-sat, kernelization, well orderings, locality}
}
@InProceedings{bogdanov_et_al:LIPIcs.CCC.2022.3,
author = {Bogdanov, Andrej and Hoza, William M. and Prakriya, Gautam and Pyne, Edward},
title = {{Hitting Sets for Regular Branching Programs}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {3:1--3:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.3},
URN = {urn:nbn:de:0030-drops-165658},
doi = {10.4230/LIPIcs.CCC.2022.3},
annote = {Keywords: Pseudorandomness, hitting set generators, space-bounded computation}
}
@InProceedings{gryaznov_et_al:LIPIcs.CCC.2022.4,
author = {Gryaznov, Svyatoslav and Pudl\'{a}k, Pavel and Talebanfard, Navid},
title = {{Linear Branching Programs and Directional Affine Extractors}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {4:1--4:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.4},
URN = {urn:nbn:de:0030-drops-165664},
doi = {10.4230/LIPIcs.CCC.2022.4},
annote = {Keywords: Boolean Functions, Average-Case Lower Bounds, AC0\lbrack2\rbrack, Affine Dispersers, Affine Extractors}
}
@InProceedings{irani_et_al:LIPIcs.CCC.2022.5,
author = {Irani, Sandy and Natarajan, Anand and Nirkhe, Chinmay and Rao, Sujit and Yuen, Henry},
title = {{Quantum Search-To-Decision Reductions and the State Synthesis Problem}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {5:1--5:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.5},
URN = {urn:nbn:de:0030-drops-165674},
doi = {10.4230/LIPIcs.CCC.2022.5},
annote = {Keywords: Search-to-decision, state synthesis, quantum computing}
}
@InProceedings{karthikc.s._et_al:LIPIcs.CCC.2022.6,
author = {Karthik C. S. and Khot, Subhash},
title = {{Almost Polynomial Factor Inapproximability for Parameterized k-Clique}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {6:1--6:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.6},
URN = {urn:nbn:de:0030-drops-165680},
doi = {10.4230/LIPIcs.CCC.2022.6},
annote = {Keywords: Parameterized Complexity, k-clique, Hardness of Approximation}
}
@InProceedings{guruswami_et_al:LIPIcs.CCC.2022.7,
author = {Guruswami, Venkatesan and Manohar, Peter and Mosheiff, Jonathan},
title = {{𝓁\underlinep-Spread and Restricted Isometry Properties of Sparse Random Matrices}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {7:1--7:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.7},
URN = {urn:nbn:de:0030-drops-165695},
doi = {10.4230/LIPIcs.CCC.2022.7},
annote = {Keywords: Spread Subspaces, Euclidean Sections, Restricted Isometry Property, Sparse Matrices}
}
@InProceedings{cook_et_al:LIPIcs.CCC.2022.8,
author = {Cook, James and Mertz, Ian},
title = {{Trading Time and Space in Catalytic Branching Programs}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {8:1--8:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.8},
URN = {urn:nbn:de:0030-drops-165708},
doi = {10.4230/LIPIcs.CCC.2022.8},
annote = {Keywords: complexity theory, branching programs, amortized, space complexity, catalytic computation}
}
@InProceedings{derksen_et_al:LIPIcs.CCC.2022.9,
author = {Derksen, Harm and Makam, Visu and Zuiddam, Jeroen},
title = {{Subrank and Optimal Reduction of Scalar Multiplications to Generic Tensors}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {9:1--9:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.9},
URN = {urn:nbn:de:0030-drops-165716},
doi = {10.4230/LIPIcs.CCC.2022.9},
annote = {Keywords: tensors, bilinear maps, complexity, subrank, diagonalization, generic tensors, random tensors, reduction, slice rank}
}
@InProceedings{blanc_et_al:LIPIcs.CCC.2022.10,
author = {Blanc, Guy and Doron, Dean},
title = {{New Near-Linear Time Decodable Codes Closer to the GV Bound}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {10:1--10:40},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.10},
URN = {urn:nbn:de:0030-drops-165726},
doi = {10.4230/LIPIcs.CCC.2022.10},
annote = {Keywords: Unique decoding, list decoding, the Gilbert-Varshamov bound, small-bias sample spaces, hypergraphs, expander walks}
}
@InProceedings{hsieh_et_al:LIPIcs.CCC.2022.11,
author = {Hsieh, Jun-Ting and Mohanty, Sidhanth and Xu, Jeff},
title = {{Certifying Solution Geometry in Random CSPs: Counts, Clusters and Balance}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {11:1--11:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.11},
URN = {urn:nbn:de:0030-drops-165735},
doi = {10.4230/LIPIcs.CCC.2022.11},
annote = {Keywords: constraint satisfaction problems, certified counting, random graphs}
}
@InProceedings{arvind_et_al:LIPIcs.CCC.2022.12,
author = {Arvind, Vikraman and Joglekar, Pushkar S.},
title = {{On Efficient Noncommutative Polynomial Factorization via Higman Linearization}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {12:1--12:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.12},
URN = {urn:nbn:de:0030-drops-165747},
doi = {10.4230/LIPIcs.CCC.2022.12},
annote = {Keywords: Noncommutative Polynomials, Arithmetic Circuits, Factorization, Identity testing}
}
@InProceedings{mihajlin_et_al:LIPIcs.CCC.2022.13,
author = {Mihajlin, Ivan and Sofronova, Anastasia},
title = {{A Better-Than-3log(n) Depth Lower Bound for De Morgan Formulas with Restrictions on Top Gates}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {13:1--13:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.13},
URN = {urn:nbn:de:0030-drops-165755},
doi = {10.4230/LIPIcs.CCC.2022.13},
annote = {Keywords: formula complexity, communication complexity, Karchmer-Raz-Wigderson conjecture, De Morgan formulas}
}
@InProceedings{karliner_et_al:LIPIcs.CCC.2022.14,
author = {Karliner, Dan and Salama, Roie and Ta-Shma, Amnon},
title = {{The Plane Test Is a Local Tester for Multiplicity Codes}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {14:1--14:33},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.14},
URN = {urn:nbn:de:0030-drops-165761},
doi = {10.4230/LIPIcs.CCC.2022.14},
annote = {Keywords: local testing, multiplicity codes, Reed Muller codes}
}
@InProceedings{sokolov:LIPIcs.CCC.2022.15,
author = {Sokolov, Dmitry},
title = {{Pseudorandom Generators, Resolution and Heavy Width}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {15:1--15:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.15},
URN = {urn:nbn:de:0030-drops-165770},
doi = {10.4230/LIPIcs.CCC.2022.15},
annote = {Keywords: proof complexity, pseudorandom generators, resolution, lower bounds}
}
@InProceedings{goldberg_et_al:LIPIcs.CCC.2022.16,
author = {Goldberg, Halley and Kabanets, Valentine and Lu, Zhenjian and Oliveira, Igor C.},
title = {{Probabilistic Kolmogorov Complexity with Applications to Average-Case Complexity}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {16:1--16:60},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.16},
URN = {urn:nbn:de:0030-drops-165785},
doi = {10.4230/LIPIcs.CCC.2022.16},
annote = {Keywords: average-case complexity, Kolmogorov complexity, meta-complexity, worst-case to average-case reductions, learning}
}
@InProceedings{khaniki:LIPIcs.CCC.2022.17,
author = {Khaniki, Erfan},
title = {{Nisan-Wigderson Generators in Proof Complexity: New Lower Bounds}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {17:1--17:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.17},
URN = {urn:nbn:de:0030-drops-165799},
doi = {10.4230/LIPIcs.CCC.2022.17},
annote = {Keywords: Proof complexity, Bounded arithmetic, Bounded depth Frege, Nisan-Wigderson generators, Meta-complexity, Lower bounds}
}
@InProceedings{odonnell_et_al:LIPIcs.CCC.2022.18,
author = {O'Donnell, Ryan and Pratt, Kevin},
title = {{High-Dimensional Expanders from Chevalley Groups}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {18:1--18:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.18},
URN = {urn:nbn:de:0030-drops-165802},
doi = {10.4230/LIPIcs.CCC.2022.18},
annote = {Keywords: High-dimensional expanders, simplicial complexes, group theory}
}
@InProceedings{lecomte_et_al:LIPIcs.CCC.2022.19,
author = {Lecomte, Victor and Ramakrishnan, Prasanna and Tan, Li-Yang},
title = {{The Composition Complexity of Majority}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {19:1--19:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.19},
URN = {urn:nbn:de:0030-drops-165818},
doi = {10.4230/LIPIcs.CCC.2022.19},
annote = {Keywords: computational complexity, circuit lower bounds}
}
@InProceedings{aaronson_et_al:LIPIcs.CCC.2022.20,
author = {Aaronson, Scott and Ingram, DeVon and Kretschmer, William},
title = {{The Acrobatics of BQP}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {20:1--20:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.20},
URN = {urn:nbn:de:0030-drops-165820},
doi = {10.4230/LIPIcs.CCC.2022.20},
annote = {Keywords: BQP, Forrelation, oracle separations, Polynomial Hierarchy, query complexity}
}
@InProceedings{kelley_et_al:LIPIcs.CCC.2022.21,
author = {Kelley, Zander and Meka, Raghu},
title = {{Random Restrictions and PRGs for PTFs in Gaussian Space}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {21:1--21:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.21},
URN = {urn:nbn:de:0030-drops-165836},
doi = {10.4230/LIPIcs.CCC.2022.21},
annote = {Keywords: polynomial threshold function, pseudorandom generator, multivariate gaussian}
}
@InProceedings{aggarwal_et_al:LIPIcs.CCC.2022.22,
author = {Aggarwal, Amol and Alman, Josh},
title = {{Optimal-Degree Polynomial Approximations for Exponentials and Gaussian Kernel Density Estimation}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {22:1--22:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.22},
URN = {urn:nbn:de:0030-drops-165846},
doi = {10.4230/LIPIcs.CCC.2022.22},
annote = {Keywords: polynomial approximation, kernel density estimation, Chebyshev polynomials}
}
@InProceedings{chen_et_al:LIPIcs.CCC.2022.23,
author = {Chen, Lijie and Li, Jiatu and Yang, Tianqi},
title = {{Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {23:1--23:37},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.23},
URN = {urn:nbn:de:0030-drops-165852},
doi = {10.4230/LIPIcs.CCC.2022.23},
annote = {Keywords: Almost universal hash functions, hardness magnification, pseudorandom functions}
}
@InProceedings{arnon_et_al:LIPIcs.CCC.2022.24,
author = {Arnon, Gal and Chiesa, Alessandro and Yogev, Eylon},
title = {{Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {24:1--24:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.24},
URN = {urn:nbn:de:0030-drops-165867},
doi = {10.4230/LIPIcs.CCC.2022.24},
annote = {Keywords: hardness of approximation, interactive oracle proofs, stochastic satisfaction problems}
}
@InProceedings{hirahara_et_al:LIPIcs.CCC.2022.25,
author = {Hirahara, Shuichi and Nanashima, Mikito},
title = {{Finding Errorless Pessiland in Error-Prone Heuristica}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {25:1--25:28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.25},
URN = {urn:nbn:de:0030-drops-165875},
doi = {10.4230/LIPIcs.CCC.2022.25},
annote = {Keywords: average-case complexity, oracle separation, relativization barrier, meta-complexity, learning, auxiliary-input cryptography}
}
@InProceedings{hirahara:LIPIcs.CCC.2022.26,
author = {Hirahara, Shuichi},
title = {{Symmetry of Information from Meta-Complexity}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {26:1--26:41},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.26},
URN = {urn:nbn:de:0030-drops-165880},
doi = {10.4230/LIPIcs.CCC.2022.26},
annote = {Keywords: resource-bounded Kolmogorov complexity, average-case complexity, pseudorandomness, hardness of approximation, unconditional lower bound}
}
@InProceedings{golowich_et_al:LIPIcs.CCC.2022.27,
author = {Golowich, Louis and Vadhan, Salil},
title = {{Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {27:1--27:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.27},
URN = {urn:nbn:de:0030-drops-165893},
doi = {10.4230/LIPIcs.CCC.2022.27},
annote = {Keywords: Expander graph, Random walk, Pseudorandomness}
}
@InProceedings{bansal_et_al:LIPIcs.CCC.2022.28,
author = {Bansal, Nikhil and Sinha, Makrand and de Wolf, Ronald},
title = {{Influence in Completely Bounded Block-Multilinear Forms and Classical Simulation of Quantum Algorithms}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {28:1--28:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.28},
URN = {urn:nbn:de:0030-drops-165908},
doi = {10.4230/LIPIcs.CCC.2022.28},
annote = {Keywords: Aaronson-Ambainis conjecture, Quantum query complexity, Classical query complexity, Free probability, Completely bounded norm, Analysis of Boolean functions, Influence}
}
@InProceedings{saks_et_al:LIPIcs.CCC.2022.29,
author = {Saks, Michael and Santhanam, Rahul},
title = {{On Randomized Reductions to the Random Strings}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {29:1--29:30},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.29},
URN = {urn:nbn:de:0030-drops-165912},
doi = {10.4230/LIPIcs.CCC.2022.29},
annote = {Keywords: Kolmogorov complexity, randomized reductions}
}
@InProceedings{bordage_et_al:LIPIcs.CCC.2022.30,
author = {Bordage, Sarah and Lhotel, Mathieu and Nardi, Jade and Randriam, Hugues},
title = {{Interactive Oracle Proofs of Proximity to Algebraic Geometry Codes}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {30:1--30:45},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.30},
URN = {urn:nbn:de:0030-drops-165923},
doi = {10.4230/LIPIcs.CCC.2022.30},
annote = {Keywords: Algebraic geometry codes, Interactive oracle proofs of proximity, Proximity testing}
}
@InProceedings{bhandari_et_al:LIPIcs.CCC.2022.31,
author = {Bhandari, Siddharth and Harsha, Prahladh and Saptharishi, Ramprasad and Srinivasan, Srikanth},
title = {{Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {31:1--31:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.31},
URN = {urn:nbn:de:0030-drops-165934},
doi = {10.4230/LIPIcs.CCC.2022.31},
annote = {Keywords: Reed-Muller codes, polynomials, weight-distribution, vanishing ideals, erasures, capacity}
}
@InProceedings{limaye_et_al:LIPIcs.CCC.2022.32,
author = {Limaye, Nutan and Srinivasan, Srikanth and Tavenas, S\'{e}bastien},
title = {{On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {32:1--32:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.32},
URN = {urn:nbn:de:0030-drops-165942},
doi = {10.4230/LIPIcs.CCC.2022.32},
annote = {Keywords: Partial Derivative Method, Barriers to Lower Bounds}
}
@InProceedings{goos_et_al:LIPIcs.CCC.2022.33,
author = {G\"{o}\"{o}s, Mika and Hollender, Alexandros and Jain, Siddhartha and Maystre, Gilbert and Pires, William and Robere, Robert and Tao, Ran},
title = {{Further Collapses in TFNP}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {33:1--33:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.33},
URN = {urn:nbn:de:0030-drops-165954},
doi = {10.4230/LIPIcs.CCC.2022.33},
annote = {Keywords: TFNP, PPAD, PLS, EOPL}
}
@InProceedings{lyu:LIPIcs.CCC.2022.34,
author = {Lyu, Xin},
title = {{Improved Pseudorandom Generators for AC⁰ Circuits}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {34:1--34:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.34},
URN = {urn:nbn:de:0030-drops-165963},
doi = {10.4230/LIPIcs.CCC.2022.34},
annote = {Keywords: pseudorandom generators, derandomization, switching Lemmas, AC⁰}
}
@InProceedings{liu_et_al:LIPIcs.CCC.2022.35,
author = {Liu, Yanyi and Pass, Rafael},
title = {{Characterizing Derandomization Through Hardness of Levin-Kolmogorov Complexity}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {35:1--35:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.35},
URN = {urn:nbn:de:0030-drops-165975},
doi = {10.4230/LIPIcs.CCC.2022.35},
annote = {Keywords: Derandomization, Kolmogorov Complexity, Hitting Set Generators}
}
@InProceedings{liu_et_al:LIPIcs.CCC.2022.36,
author = {Liu, Yanyi and Pass, Rafael},
title = {{On One-Way Functions from NP-Complete Problems}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {36:1--36:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.36},
URN = {urn:nbn:de:0030-drops-165981},
doi = {10.4230/LIPIcs.CCC.2022.36},
annote = {Keywords: One-way Functions, NP-Completeness, Kolmogorov Complexity}
}
@InProceedings{korten:LIPIcs.CCC.2022.37,
author = {Korten, Oliver},
title = {{Derandomization from Time-Space Tradeoffs}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {37:1--37:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.37},
URN = {urn:nbn:de:0030-drops-165993},
doi = {10.4230/LIPIcs.CCC.2022.37},
annote = {Keywords: Pseudorandomness, circuit complexity, total functions}
}
@InProceedings{kush_et_al:LIPIcs.CCC.2022.38,
author = {Kush, Deepanshu and Saraf, Shubhangi},
title = {{Improved Low-Depth Set-Multilinear Circuit Lower Bounds}},
booktitle = {37th Computational Complexity Conference (CCC 2022)},
pages = {38:1--38:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-241-9},
ISSN = {1868-8969},
year = {2022},
volume = {234},
editor = {Lovett, Shachar},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.38},
URN = {urn:nbn:de:0030-drops-166003},
doi = {10.4230/LIPIcs.CCC.2022.38},
annote = {Keywords: algebraic circuit complexity, complexity measure, set-multilinear formulas}
}
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