The STO-Problem is NP-Hard

Krzysztof R. Apt, Peter van Emde Boas, Angelo Welling. The STO-Problem is NP-Hard. Journal of Symbolic Computation, 18(5):489-495, 1994.

Authors

Krzysztof R. Apt

Identified as Krzysztof R. Apt

Peter van Emde Boas

This author has not been identified. Look up 'Peter van Emde Boas' in Google

Angelo Welling

This author has not been identified. Look up 'Angelo Welling' in Google