Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
Theoretical Computer Science · 2023-10 · 975 · 114128
DOI: 10.1016/j.tcs.2023.114128 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2023-10. Verfasst von Massimo Equi und 2 weiteren Autor:innen. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 63 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: European Research Council, Academy of Finland, Horizon 2020.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- European Research Council
- Academy of Finland
- Horizon 2020
Zitieren
APA
Equi, M., Mäkinen, V., & Tomescu, A. I. (2023). Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. Theoretical Computer Science, 975, 114128. https://doi.org/10.1016/j.tcs.2023.114128
Vancouver
Equi M, Mäkinen V, Tomescu AI. Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. Theoretical Computer Science. 2023;975:114128. doi:10.1016/j.tcs.2023.114128
BibTeX
@article{Equi2023,
author = {Equi, Massimo and Mäkinen, Veli and Tomescu, Alexandru I.},
title = {Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails},
journal = {Theoretical Computer Science},
year = {2023},
volume = {975},
pages = {114128},
doi = {10.1016/j.tcs.2023.114128}
}
EUVIMED