[go: up one dir, main page]

"The STO problem is NP-complete."

Piotr Krysta, Leszek Pacholski (1999)

Details and statistics

DOI: 10.1006/JSCO.1998.0249

access: open

type: Journal Article

metadata version: 2021-02-17