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: 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

Journal number: 12607

Journal publisher: Springer International Publishing

Published year: 2021

Published pages: 608-622

DOI identifier: 10.1007/978-3-030-67731-2_44

ISBN: 978-3-030-67730-5