@InProceedings{bourneuf_et_al:LIPIcs.ITCS.2023.22,
author = {Bourneuf, Romain and Folwarczn\'{y}, Luk\'{a}\v{s} and Hub\'{a}\v{c}ek, Pavel and Rosen, Alon and Schwartzbach, Nikolaj I.},
title = {{PPP-Completeness and Extremal Combinatorics}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {22:1--22:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.22},
URN = {urn:nbn:de:0030-drops-175255},
doi = {10.4230/LIPIcs.ITCS.2023.22},
annote = {Keywords: total search problems, extremal combinatorics, PPP-completeness}
}