The STO problem is NP-complete (Q1284283)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The STO problem is NP-complete |
scientific article |
Statements
The STO problem is NP-complete (English)
0 references
25 May 2000
0 references