Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails

Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu. Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. Theoretical Computer Science, 975:114128, October 2023. [doi]

Abstract

Abstract is missing.