Piotr Krysta Leszek Pacholski The STO problem is NP-complete. 207-219 1999 27 J. Symb. Comput. 2 db/journals/jsc/jsc27.html#KrystaP99