Complexity of min-max subsequence problems (Q1014423)
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 5547802
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of min-max subsequence problems |
scientific article; zbMATH DE number 5547802 |
Statements
Complexity of min-max subsequence problems (English)
0 references
28 April 2009
0 references
computational complexity
0 references
polynomial-time approximation scheme
0 references
min-max subsequence problem
0 references
0.7940937876701355
0 references
0.7940937876701355
0 references
0.7389384508132935
0 references
0.7306665182113647
0 references
