Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.4230/LIPIcs.ITCS.2018.35 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2782583418 / rank | |||
Normal rank | |||
| Property / title | |||
Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (English) | |||
| Property / title: Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (English) / rank | |||
Normal rank | |||
Revision as of 10:22, 30 July 2024
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
