External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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. 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]

Authors

Massimo Equi

This author has not been identified. Look up 'Massimo Equi' in Google

Veli Mäkinen

This author has not been identified. Look up 'Veli Mäkinen' in Google

Alexandru I. Tomescu

This author has not been identified. Look up 'Alexandru I. Tomescu' in Google
runs on