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

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu

Journal title: Theoretical Computer Science

Journal number: 975

Journal publisher: Elsevier BV

Published year: 2024

Published pages: 114128

DOI identifier: 10.1016/j.tcs.2023.114128

ISSN: 0304-3975