Feedback on the Current Page
Published in: LIPIcs, Volume 374, 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026)
Susanna F. de Rezende, David Engström, Yassine Ghannane, Duri Andrea Janett, and Artur Riazanov. Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity. In 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 374, pp. 151:1-151:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{derezende_et_al:LIPIcs.ICALP.2026.151,
author = {de Rezende, Susanna F. and Engstr\"{o}m, David and Ghannane, Yassine and Janett, Duri Andrea and Riazanov, Artur},
title = {{Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity}},
booktitle = {53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026)},
pages = {151:1--151:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-428-4},
ISSN = {1868-8969},
year = {2026},
volume = {374},
editor = {Bhattacharya, Sayan and Nanongkai, Danupon and Benedikt, Michael and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.151},
URN = {urn:nbn:de:0030-drops-265407},
doi = {10.4230/LIPIcs.ICALP.2026.151},
annote = {Keywords: proof complexity, communication complexity, cutting planes, bounded-depth resolution over parities, clique problem, average-case hardness, binary encoding}
}