The STO problem is NP-complete (Q1284283)
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 1271879
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The STO problem is NP-complete |
scientific article; zbMATH DE number 1271879 |
Statements
The STO problem is NP-complete (English)
0 references
25 May 2000
0 references
0.9449102878570556
0 references
0.7542392015457153
0 references
0.7251830697059631
0 references
0.7159639000892639
0 references
