MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "NP is as Easy as Detecting Unique Solutions." – sorted by Relevance.

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

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

4 documents found, showing 1 through 4.

ATOM

The Complexity of Planar Counting Problems
by Harry B. Hunt, III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard, Richard E. Stearns — 1998
… satisfiability problems [L. G. Valiant and V. V. Vazirani, NP is as easy as detecting unique solutions, in Proc…
Cited by 1 (0 self) – Add To MetaCart

A Promise Class at Least as Hard as the Polynomial Hierarchy
by Jorg Rothe — 1994
…. VAZIRANI, NP is as easy as detecting unique solutions. Theoretical Computer Science 47, 1986, 85-93; also…
Add To MetaCart

Applications of Polynomial and Rational Approximation. . .
by Nicolas Frederick Reingold, K. Siu, V. Roychowdhury — 1992
… 1991. [45] L. G. Valiant and V. V. Vazirani. NP is as easy as detecting unique solutions. Theoretical…
Add To MetaCart

Computing Solutions Uniquely Collapses the Polynomial Hierarchy
by Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman — 1993 — SIAM Journal on Computing
… is as easy as detecting unique solutions," has rightly been the focus of great attention. Their breakthrough…
Cited by 36 (22 self) – Add To MetaCart

Showing 1 through 4.

ATOM

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