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 this page instead for the normal view: The STO problem is NP-complete |
scientific article; zbMATH DE number 1271879
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
