Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can) (Q5888939): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/3381878 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3040166286 / rank | |||
Normal rank | |||
Latest revision as of 20:01, 19 March 2024
scientific article; zbMATH DE number 7678780
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
