Searching for "The STO problem is NP-complete." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

The STO-problem is NP-hard
by Krzysztof R. Apt, Peter Van, Peter Van Emde Boas, Angelo Welling — 1994
…. Theorem 3.7. The STO-problem is NP-hard. Proof. We provide a reduction from the known NP-Complete…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB