Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails |
scientific article |
Statements
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (English)
0 references
24 March 2022
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
0 references
0.7362646460533142
0 references
0.7340202927589417
0 references
0.7253633737564087
0 references
0.7189627885818481
0 references
