The Complexity of Problems in P Given Correlated Instances (Q4638062)
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: The Complexity of Problems in P Given Correlated Instances |
scientific article; zbMATH DE number 6866303
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Problems in P Given Correlated Instances |
scientific article; zbMATH DE number 6866303 |
Statements
3 May 2018
0 references
correlated instances
0 references
longest common subsequence
0 references
fine-grained complexity
0 references
0 references
0 references
The Complexity of Problems in P Given Correlated Instances (English)
0 references
0.8874241
0 references
0.87802494
0 references
0.8726298
0 references
0.86144453
0 references
0.8522095
0 references
0.8509631
0 references
0.84956515
0 references
0.8486128
0 references
