Polylogarithmic approximation for edit distance and the asymmetric query complexity (Q4933374)
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: Polylogarithmic approximation for edit distance and the asymmetric query complexity |
scientific article; zbMATH DE number 5799063
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polylogarithmic approximation for edit distance and the asymmetric query complexity |
scientific article; zbMATH DE number 5799063 |
Statements
Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity (English)
0 references
12 October 2010
0 references
edit distance
0 references
sampling
0 references
query complexity
0 references
0.8628825545310974
0 references
0.8627060651779175
0 references
0.8287907838821411
0 references
0.8239254951477051
0 references
0.8211959004402161
0 references
