@dblp

Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails.

, , und . SOFSEM, Volume 12607 von Lecture Notes in Computer Science, Seite 608-622. Springer, (2021)

Links und Ressourcen

Tags