The STO-problem is NP-hard
From MaRDI portal
Publication:1892125
DOI10.1006/jsco.1994.1060zbMath0826.68030OpenAlexW2073721548MaRDI QIDQ1892125
Angelo Welling, Krzysztof R. Apt, Peter van Emde Boas
Publication date: 3 July 1995
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://pure.uva.nl/ws/files/4425487/1173_12200y.pdf
This page was built for publication: The STO-problem is NP-hard