"The STO-Problem is NP-Hard."

Krzysztof R. Apt, Peter van Emde Boas, Angelo Welling (1994)

Details and statistics

DOI: 10.1006/JSCO.1994.1060

access: open

type: Journal Article

metadata version: 2021-02-17

a service of  Schloss Dagstuhl - Leibniz Center for Informatics