Login / Signup

The STO problem is NP-complete.

Piotr KrystaLeszek Pacholski
Published in: J. Symb. Comput. (1999)
Keyphrases