@InProceedings{lokshtanov_et_al:LIPIcs.FUN.2022.19,
author = {Lokshtanov, Daniel and Subercaseaux, Bernardo},
title = {{Wordle Is NP-Hard}},
booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)},
pages = {19:1--19:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-232-7},
ISSN = {1868-8969},
year = {2022},
volume = {226},
editor = {Fraigniaud, Pierre and Uno, Yushi},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.19},
URN = {urn:nbn:de:0030-drops-159893},
doi = {10.4230/LIPIcs.FUN.2022.19},
annote = {Keywords: wordle, np-hardness, complexity}
}