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 this page instead for the normal view: Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds |
scientific article; zbMATH DE number 7359372
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
