The STO-problem is NP-hard

1994

Journal of Symbolic Computation , Volume 18 - Issue 5 p. 489- 495

Additional Metadata
MSC	Analysis of algorithms and problem complexity (msc 68Q25), Logic programming (msc 68N17)
Publisher	Academic Press
Journal	Journal of Symbolic Computation
Organisation	Networks and Optimization
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Apt, K., van Emde Boas, P., & Welling, A. (1994). The STO-problem is NP-hard. Journal of Symbolic Computation, 18(5), 489–495.

Publication