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.