Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made (Q5361845): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Virginia Vassilevska Williams / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: R. Ryan Williams / rank | |||
Normal rank | |||
Revision as of 19:18, 21 February 2024
scientific article; zbMATH DE number 6784086
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
