Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu. Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails. In Tomás Bures, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdzinski, Claus Pahl, Florian Sikora, Prudence W. H. Wong, editors, SOFSEM 2021: Theory and Practice of Computer Science - 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings. Volume 12607 of Lecture Notes in Computer Science, pages 608-622, Springer, 2021. [doi]
@inproceedings{EquiMT21,
title = {Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails},
author = {Massimo Equi and Veli Mäkinen and Alexandru I. Tomescu},
year = {2021},
doi = {10.1007/978-3-030-67731-2_44},
url = {https://doi.org/10.1007/978-3-030-67731-2_44},
researchr = {https://researchr.org/publication/EquiMT21},
cites = {0},
citedby = {0},
pages = {608-622},
booktitle = {SOFSEM 2021: Theory and Practice of Computer Science - 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings},
editor = {Tomás Bures and Riccardo Dondi and Johann Gamper and Giovanna Guerrini and Tomasz Jurdzinski and Claus Pahl and Florian Sikora and Prudence W. H. Wong},
volume = {12607},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-67731-2},
}