Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made (Q5361845)
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 6784086
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made |
scientific article; zbMATH DE number 6784086 |
Statements
Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made (English)
0 references
29 September 2017
0 references
edit distance
0 references
SETH
0 references
circuit complexity
0 references
longest common subsequence
0 references
lower bounds
0 references
0.8470316529273987
0 references
0.8083703517913818
0 references
0.7717682719230652
0 references
0.7700919508934021
0 references
0.7647827863693237
0 references
