Searching for "On the Instance Complexity of NP-Hard Problems." – 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.

Reductions to Sets of Low Information Content
by V. Arvind — 1992
…, June/July 1991. P. Orponen. On the instance complexity of NP-hard problems. In Proceedings of the 5th…
Cited by 23 (5 self) – Add To MetaCart

Showing 1 through 1.

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