CT-1994-08: The STO-problem is NP-hard

CT-1994-08: Apt, Krzysztof R. and van Emde Boas, Peter and Welling, Angelo (1994) The STO-problem is NP-hard. [Report]

[thumbnail of Full Text]
Text (Full Text)

Download (987kB) | Preview
Item Type: Report
Report Nr: CT-1994-08
Series Name: Computation and Complexity Theory (CT)
Year: 1994
Date Deposited: 12 Oct 2016 14:39
Last Modified: 12 Oct 2016 14:39
URI: https://eprints.illc.uva.nl/id/eprint/1056

Actions (login required)

View Item View Item