@InProceedings{bringmann_et_al:LIPIcs.ITCS.2024.22,
author = {Bringmann, Karl and Gr{\o}nlund, Allan and K\"{u}nnemann, Marvin and Larsen, Kasper Green},
title = {{The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {22:1--22:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.22},
URN = {urn:nbn:de:0030-drops-195500},
doi = {10.4230/LIPIcs.ITCS.2024.22},
annote = {Keywords: Fine-grained complexity theory, non-deterministic finite automata}
}