Searching for "Probabilistically checkable proofs and their consequences for approximation algorithms." – 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.

Probabilistically Checkable Proofs and their Consequences for Approximation Algorithms
by S. Hougardy, H.J. Prömel, A. Steger — 1995
…Probabilistically Checkable Proofs and their Consequences for Approximation Algorithms S. Hougardy…
Cited by 3 (0 self) – Add To MetaCart

Showing 1 through 1.

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