@Proceedings{tashma:LIPIcs.CCC.2023,
title = {{LIPIcs, Volume 264, CCC 2023, Complete Volume}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {1--936},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023},
URN = {urn:nbn:de:0030-drops-182690},
doi = {10.4230/LIPIcs.CCC.2023},
annote = {Keywords: LIPIcs, Volume 264, CCC 2023, Complete Volume}
}
@InProceedings{tashma:LIPIcs.CCC.2023.0,
author = {Ta-Shma, Amnon},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {0:i--0:xiv},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.0},
URN = {urn:nbn:de:0030-drops-182703},
doi = {10.4230/LIPIcs.CCC.2023.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{cheung_et_al:LIPIcs.CCC.2023.1,
author = {Cheung, Tsun-Ming and Hatami, Hamed and Hosseini, Kaave and Shirley, Morgan},
title = {{Separation of the Factorization Norm and Randomized Communication Complexity}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {1:1--1:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.1},
URN = {urn:nbn:de:0030-drops-182714},
doi = {10.4230/LIPIcs.CCC.2023.1},
annote = {Keywords: Factorization norms, randomized communication complexity}
}
@InProceedings{chatterjee_et_al:LIPIcs.CCC.2023.2,
author = {Chatterjee, Abhranil and Ghosh, Sumanta and Gurjar, Rohit and Raj, Roshan},
title = {{Border Complexity of Symbolic Determinant Under Rank One Restriction}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {2:1--2:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.2},
URN = {urn:nbn:de:0030-drops-182721},
doi = {10.4230/LIPIcs.CCC.2023.2},
annote = {Keywords: Border Complexity, Symbolic Determinant, Valuated Matroid}
}
@InProceedings{ivanov_et_al:LIPIcs.CCC.2023.3,
author = {Ivanov, Peter and Pavlovic, Liam and Viola, Emanuele},
title = {{On Correlation Bounds Against Polynomials}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {3:1--3:35},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.3},
URN = {urn:nbn:de:0030-drops-182734},
doi = {10.4230/LIPIcs.CCC.2023.3},
annote = {Keywords: Correlation bounds, Polynomials}
}
@InProceedings{galesi_et_al:LIPIcs.CCC.2023.4,
author = {Galesi, Nicola and Grochow, Joshua A. and Pitassi, Toniann and She, Adrian},
title = {{On the Algebraic Proof Complexity of Tensor Isomorphism}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {4:1--4:40},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.4},
URN = {urn:nbn:de:0030-drops-182748},
doi = {10.4230/LIPIcs.CCC.2023.4},
annote = {Keywords: Algebraic proof complexity, Tensor Isomorphism, Graph Isomorphism, Polynomial Calculus, Sum-of-Squares, reductions, lower bounds, proof complexity of linear algebra}
}
@InProceedings{hu_et_al:LIPIcs.CCC.2023.5,
author = {Hu, Lunjia and Livni Navon, Inbal Rachel and Reingold, Omer},
title = {{Generative Models of Huge Objects}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {5:1--5:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.5},
URN = {urn:nbn:de:0030-drops-182758},
doi = {10.4230/LIPIcs.CCC.2023.5},
annote = {Keywords: pseudorandomness, generative models, regularity lemma}
}
@InProceedings{hirahara_et_al:LIPIcs.CCC.2023.6,
author = {Hirahara, Shuichi and Lu, Zhenjian and Ren, Hanlin},
title = {{Bounded Relativization}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {6:1--6:45},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.6},
URN = {urn:nbn:de:0030-drops-182764},
doi = {10.4230/LIPIcs.CCC.2023.6},
annote = {Keywords: relativization, circuit lower bound, derandomization, explicit construction, pseudodeterministic algorithms, interactive proofs}
}
@InProceedings{impagliazzo_et_al:LIPIcs.CCC.2023.7,
author = {Impagliazzo, Russell and Mouli, Sasank and Pitassi, Toniann},
title = {{Lower Bounds for Polynomial Calculus with Extension Variables over Finite Fields}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {7:1--7:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.7},
URN = {urn:nbn:de:0030-drops-182774},
doi = {10.4230/LIPIcs.CCC.2023.7},
annote = {Keywords: Proof complexity, Algebraic proof systems, Polynomial Calculus, Extension variables, AC⁰\lbrackp\rbrack-Frege}
}
@InProceedings{cohen_et_al:LIPIcs.CCC.2023.8,
author = {Cohen, Gil and Cohen, Itay},
title = {{Spectral Expanding Expanders}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {8:1--8:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.8},
URN = {urn:nbn:de:0030-drops-182780},
doi = {10.4230/LIPIcs.CCC.2023.8},
annote = {Keywords: Expanders, Normalized Random Walk, Spectral Analysis}
}
@InProceedings{chattopadhyay_et_al:LIPIcs.CCC.2023.9,
author = {Chattopadhyay, Eshan and Liao, Jyun-Jie},
title = {{Hardness Against Linear Branching Programs and More}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {9:1--9:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.9},
URN = {urn:nbn:de:0030-drops-182794},
doi = {10.4230/LIPIcs.CCC.2023.9},
annote = {Keywords: linear branching programs, circuit lower bound, sumset extractors, hitting sets}
}
@InProceedings{abdolazimi_et_al:LIPIcs.CCC.2023.10,
author = {Abdolazimi, Dorna and Oveis Gharan, Shayan},
title = {{An Improved Trickle down Theorem for Partite Complexes}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {10:1--10:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.10},
URN = {urn:nbn:de:0030-drops-182807},
doi = {10.4230/LIPIcs.CCC.2023.10},
annote = {Keywords: Simplicial complexes, High dimensional expanders, Trickle down theorem, Bounded degree high dimensional expanders, Locally testable codes, Random walks}
}
@InProceedings{doron_et_al:LIPIcs.CCC.2023.11,
author = {Doron, Dean and Tell, Roei},
title = {{Derandomization with Minimal Memory Footprint}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.11},
URN = {urn:nbn:de:0030-drops-182816},
doi = {10.4230/LIPIcs.CCC.2023.11},
annote = {Keywords: derandomization, space-bounded computation, catalytic space}
}
@InProceedings{goldberg_et_al:LIPIcs.CCC.2023.12,
author = {Goldberg, Halley and Kabanets, Valentine},
title = {{Improved Learning from Kolmogorov Complexity}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {12:1--12:29},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.12},
URN = {urn:nbn:de:0030-drops-182825},
doi = {10.4230/LIPIcs.CCC.2023.12},
annote = {Keywords: learning, Kolmogorov complexity, meta-complexity, average-case complexity}
}
@InProceedings{chatterjee_et_al:LIPIcs.CCC.2023.13,
author = {Chatterjee, Prerona and Hrube\v{s}, Pavel},
title = {{New Lower Bounds Against Homogeneous Non-Commutative Circuits}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {13:1--13:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.13},
URN = {urn:nbn:de:0030-drops-182835},
doi = {10.4230/LIPIcs.CCC.2023.13},
annote = {Keywords: Algebraic circuit complexity, Non-Commutative Circuits, Homogeneous Computation, Lower bounds against algebraic circuits}
}
@InProceedings{block_et_al:LIPIcs.CCC.2023.14,
author = {Block, Alexander R. and Blocki, Jeremiah and Cheng, Kuan and Grigorescu, Elena and Li, Xin and Zheng, Yu and Zhu, Minshen},
title = {{On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {14:1--14:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.14},
URN = {urn:nbn:de:0030-drops-182847},
doi = {10.4230/LIPIcs.CCC.2023.14},
annote = {Keywords: Relaxed Locally Decodable Codes, Hamming Errors, Insdel Errors, Lower Bounds}
}
@InProceedings{kush_et_al:LIPIcs.CCC.2023.15,
author = {Kush, Deepanshu and Saraf, Shubhangi},
title = {{Near-Optimal Set-Multilinear Formula Lower Bounds}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {15:1--15:33},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.15},
URN = {urn:nbn:de:0030-drops-182855},
doi = {10.4230/LIPIcs.CCC.2023.15},
annote = {Keywords: Algebraic Complexity, Set-multilinear, Formula Lower Bounds}
}
@InProceedings{alman_et_al:LIPIcs.CCC.2023.16,
author = {Alman, Josh and B{\l}asiok, Jaros{\l}aw},
title = {{Matrix Multiplication and Number on the Forehead Communication}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {16:1--16:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.16},
URN = {urn:nbn:de:0030-drops-182861},
doi = {10.4230/LIPIcs.CCC.2023.16},
annote = {Keywords: Number on the forehead, communication complexity, matrix multiplication}
}
@InProceedings{vanmelkebeek_et_al:LIPIcs.CCC.2023.17,
author = {van Melkebeek, Dieter and Mocelin Sdroievski, Nicollas},
title = {{Instance-Wise Hardness Versus Randomness Tradeoffs for Arthur-Merlin Protocols}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {17:1--17:36},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.17},
URN = {urn:nbn:de:0030-drops-182870},
doi = {10.4230/LIPIcs.CCC.2023.17},
annote = {Keywords: Hardness versus randomness tradeoff, Arthur-Merlin protocol, targeted hitting set generator}
}
@InProceedings{kumar:LIPIcs.CCC.2023.18,
author = {Kumar, Vinayak M.},
title = {{Tight Correlation Bounds for Circuits Between AC0 and TC0}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {18:1--18:40},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.18},
URN = {urn:nbn:de:0030-drops-182885},
doi = {10.4230/LIPIcs.CCC.2023.18},
annote = {Keywords: AC⁰, TC⁰, Switching Lemma, Lower Bounds, Correlation Bounds, Circuit Complexity}
}
@InProceedings{harsha_et_al:LIPIcs.CCC.2023.19,
author = {Harsha, Prahladh and Molli, Tulasimohan and Shankar, Ashutosh},
title = {{Criticality of AC⁰-Formulae}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {19:1--19:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.19},
URN = {urn:nbn:de:0030-drops-182898},
doi = {10.4230/LIPIcs.CCC.2023.19},
annote = {Keywords: AC⁰ circuits, AC⁰ formulae, criticality, switching lemma, correlation bounds}
}
@InProceedings{garg_et_al:LIPIcs.CCC.2023.20,
author = {Garg, Abhibhav and Oliveira, Rafael and Peleg, Shir and Sengupta, Akash Kumar},
title = {{Radical Sylvester-Gallai Theorem for Tuples of Quadratics}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {20:1--20:30},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.20},
URN = {urn:nbn:de:0030-drops-182903},
doi = {10.4230/LIPIcs.CCC.2023.20},
annote = {Keywords: Sylvester-Gallai theorem, arrangements of hypersurfaces, algebraic complexity, polynomial identity testing, algebraic geometry, commutative algebra}
}
@InProceedings{chen_et_al:LIPIcs.CCC.2023.21,
author = {Chen, Xi and Li, Yuhao and Yannakakis, Mihalis},
title = {{Reducing Tarski to Unique Tarski (In the Black-Box Model)}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {21:1--21:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.21},
URN = {urn:nbn:de:0030-drops-182919},
doi = {10.4230/LIPIcs.CCC.2023.21},
annote = {Keywords: Tarski fixed point, Query complexity, TFNP}
}
@InProceedings{natarajan_et_al:LIPIcs.CCC.2023.22,
author = {Natarajan, Anand and Nirkhe, Chinmay},
title = {{A Distribution Testing Oracle Separating QMA and QCMA}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {22:1--22:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.22},
URN = {urn:nbn:de:0030-drops-182928},
doi = {10.4230/LIPIcs.CCC.2023.22},
annote = {Keywords: quantum non-determinism, complexity theory}
}
@InProceedings{aharonov_et_al:LIPIcs.CCC.2023.23,
author = {Aharonov, Dorit and Irani, Sandy},
title = {{Translationally Invariant Constraint Optimization Problems}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {23:1--23:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.23},
URN = {urn:nbn:de:0030-drops-182932},
doi = {10.4230/LIPIcs.CCC.2023.23},
annote = {Keywords: Constraint satisfaction, Tiling, Translational-invariance}
}
@InProceedings{ambainis_et_al:LIPIcs.CCC.2023.24,
author = {Ambainis, Andris and Belovs, Aleksandrs},
title = {{An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {24:1--24:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.24},
URN = {urn:nbn:de:0030-drops-182943},
doi = {10.4230/LIPIcs.CCC.2023.24},
annote = {Keywords: Polynomials, Quantum Adversary Bound, Separations in Query Complexity}
}
@InProceedings{arunachalam_et_al:LIPIcs.CCC.2023.25,
author = {Arunachalam, Srinivasan and Girish, Uma},
title = {{Trade-Offs Between Entanglement and Communication}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {25:1--25:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.25},
URN = {urn:nbn:de:0030-drops-182957},
doi = {10.4230/LIPIcs.CCC.2023.25},
annote = {Keywords: quantum, communication complexity, exponential separation, boolean hidden matching, forrelation, xor lemma}
}
@InProceedings{viola:LIPIcs.CCC.2023.26,
author = {Viola, Emanuele},
title = {{New Sampling Lower Bounds via the Separator}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {26:1--26:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.26},
URN = {urn:nbn:de:0030-drops-182967},
doi = {10.4230/LIPIcs.CCC.2023.26},
annote = {Keywords: Sampling, data structures, lower bounds, cell probe, decision forest, AC0, rank, predecessor}
}
@InProceedings{dorsi_et_al:LIPIcs.CCC.2023.27,
author = {d'Orsi, Tommaso and Trevisan, Luca},
title = {{A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {27:1--27:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.27},
URN = {urn:nbn:de:0030-drops-182979},
doi = {10.4230/LIPIcs.CCC.2023.27},
annote = {Keywords: CSP, k-XOR, strong refutation, sum-of-squares, tensor, graph, hypergraph, non-backtracking walk}
}
@InProceedings{fournier_et_al:LIPIcs.CCC.2023.28,
author = {Fournier, Herv\'{e} and Limaye, Nutan and Malod, Guillaume and Srinivasan, Srikanth and Tavenas, S\'{e}bastien},
title = {{Towards Optimal Depth-Reductions for Algebraic Formulas}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {28:1--28:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.28},
URN = {urn:nbn:de:0030-drops-182986},
doi = {10.4230/LIPIcs.CCC.2023.28},
annote = {Keywords: Algebraic formulas, depth-reduction}
}
@InProceedings{cavalar_et_al:LIPIcs.CCC.2023.29,
author = {Cavalar, Bruno P. and Oliveira, Igor C.},
title = {{Constant-Depth Circuits vs. Monotone Circuits}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {29:1--29:37},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.29},
URN = {urn:nbn:de:0030-drops-182998},
doi = {10.4230/LIPIcs.CCC.2023.29},
annote = {Keywords: circuit complexity, monotone circuit complexity, bounded-depth circuis, constraint-satisfaction problems}
}
@InProceedings{kunisky_et_al:LIPIcs.CCC.2023.30,
author = {Kunisky, Dmitriy and Yu, Xifan},
title = {{A Degree 4 Sum-Of-Squares Lower Bound for the Clique Number of the Paley Graph}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {30:1--30:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.30},
URN = {urn:nbn:de:0030-drops-183008},
doi = {10.4230/LIPIcs.CCC.2023.30},
annote = {Keywords: convex optimization, sum of squares, Paley graph, derandomization}
}
@InProceedings{austrin_et_al:LIPIcs.CCC.2023.31,
author = {Austrin, Per and Risse, Kilian},
title = {{Sum-Of-Squares Lower Bounds for the Minimum Circuit Size Problem}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {31:1--31:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.31},
URN = {urn:nbn:de:0030-drops-183011},
doi = {10.4230/LIPIcs.CCC.2023.31},
annote = {Keywords: Proof Complexity, Sum of Squares, Minimum Circuit Size Problem}
}
@InProceedings{liu_et_al:LIPIcs.CCC.2023.32,
author = {Liu, Yanyi and Pass, Rafael},
title = {{Leakage-Resilient Hardness vs Randomness}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {32:1--32:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.32},
URN = {urn:nbn:de:0030-drops-183022},
doi = {10.4230/LIPIcs.CCC.2023.32},
annote = {Keywords: Derandomization, Leakage-Resilient Hardness}
}
@InProceedings{chia_et_al:LIPIcs.CCC.2023.33,
author = {Chia, Nai-Hui and Chung, Kai-Min and Hsieh, Yao-Ching and Lin, Han-Hsuan and Lin, Yao-Ting and Shen, Yu-Ching},
title = {{On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {33:1--33:45},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.33},
URN = {urn:nbn:de:0030-drops-183038},
doi = {10.4230/LIPIcs.CCC.2023.33},
annote = {Keywords: Hamiltonian simulation, Depth lower bound, Parallel query lower bound}
}
@InProceedings{bittel_et_al:LIPIcs.CCC.2023.34,
author = {Bittel, Lennart and Gharibian, Sevag and Kliesch, Martin},
title = {{The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {34:1--34:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.34},
URN = {urn:nbn:de:0030-drops-183045},
doi = {10.4230/LIPIcs.CCC.2023.34},
annote = {Keywords: Variational quantum algorithms (VQA), Quantum Approximate Optimization Algorithm (QAOA), circuit depth minimization, Quantum-Classical Merlin-Arthur (QCMA), hardness of approximation, hybrid quantum algorithms}
}
@InProceedings{santhanam:LIPIcs.CCC.2023.35,
author = {Santhanam, Rahul},
title = {{An Algorithmic Approach to Uniform Lower Bounds}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {35:1--35:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.35},
URN = {urn:nbn:de:0030-drops-183053},
doi = {10.4230/LIPIcs.CCC.2023.35},
annote = {Keywords: Probabilistic Kolmogorov complexity, sampling algorithms, uniform lower bounds}
}
@InProceedings{davis_et_al:LIPIcs.CCC.2023.36,
author = {Davis, Ben and Robere, Robert},
title = {{Colourful TFNP and Propositional Proofs}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {36:1--36:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-282-2},
ISSN = {1868-8969},
year = {2023},
volume = {264},
editor = {Ta-Shma, Amnon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.36},
URN = {urn:nbn:de:0030-drops-183066},
doi = {10.4230/LIPIcs.CCC.2023.36},
annote = {Keywords: oracle separations, TFNP, proof complexity, Res(k), lower bounds}
}
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