The STO problem is NP-Hard
In: Journal of Symbolic Computation, Jg. 18 (1995), S. 489-495
Online
serialPeriodical
Titel: |
The STO problem is NP-Hard
|
---|---|
Autor/in / Beteiligte Person: | Apt, K.R. ; van Emde Boas, P. ; Welling, A. ; Logic and Computation (ILLC, FNWI/FGw) |
Link: | |
Zeitschrift: | Journal of Symbolic Computation, Jg. 18 (1995), S. 489-495 |
Veröffentlichung: | 1995 |
Medientyp: | serialPeriodical |
ISSN: | 0747-7171 (print) |
DOI: | 10.1006/jsco.1994.1060 |
Sonstiges: |
|