The STO-Problem is NP-Hard. - Krzysztof R. Apt; Peter van Emde Boas; Angelo Welling (J. Symb. Comput., 1994)