Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can) (Q5888939)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7678780
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can) |
scientific article; zbMATH DE number 7678780 |
Statements
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can) (English)
0 references
26 April 2023
0 references
conditional lower bound
0 references
string edit distance
0 references
tree edit distance
0 references
0.9991814494132996
0 references
0.8706431984901428
0 references
0.8690519332885742
0 references
0.8676331639289856
0 references
0.8617424368858337
0 references
