Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352): Difference between revisions
From MaRDI portal
Latest revision as of 18:13, 30 December 2024
scientific article; zbMATH DE number 7741112
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails |
scientific article; zbMATH DE number 7741112 |
Statements
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (English)
0 references
21 September 2023
0 references
exact pattern matching
0 references
indexing
0 references
orthogonal vectors
0 references
complexity theory
0 references
reductions
0 references
lower bounds
0 references
edit distance
0 references
graph query
0 references
Fréchet distance
0 references
subtree isomorphism
0 references
0 references
0 references
