Fast and deterministic constant factor approximation algorithms for LCS imply new circuit lower bounds (Q4993300)
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 7359372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast and deterministic constant factor approximation algorithms for LCS imply new circuit lower bounds |
scientific article; zbMATH DE number 7359372 |
Statements
15 June 2021
0 references
distributed PCP
0 references
longest common subsequence
0 references
fine-grained complexity
0 references
circuit lower bounds
0 references
strong exponential time hypothesis
0 references
0 references
0 references
0 references
0 references
Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (English)
0 references
0.8102130889892578
0 references
0.8090341687202454
0 references
0.80469810962677
0 references
0.7942606210708618
0 references
0.7941886782646179
0 references
