- The STO problem is NP-complete
Description
- Title: The STO problem is NP-complete
- Journal title: Journal of Symbolic Computation
- Creator: Krysta, Piotr ; Pacholski, Leszek
- Pages: s. 207-219
- Description: Abstr.
- Language of abstract: eng
- Date issued: 1999
- Type: Tekst
- Language: eng
- Detailed object type: art
- Object type: Artykuł
- Location: Vol. 27, iss. 2 (1999)