Searching for "The STO-Problem is NP-Hard." – 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
…J. Symbolic Computation (1995) 11, 1--000 The STO-problem is NP-hard KRZYSZTOF R. APT y…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 1.

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