From siteseer, I am reading this, references the well-known "NP is as easy as detecting unique solutions" by Valiant and Vazirani (I lost my digital copy of that article).
The zoo comes in handy when reading an article like this.
10/5/07
Computing Solutions Uniquely Collapses the Polynomial Hierarchy
From siteseer, I am reading this, references the well-known "NP is as easy as detecting unique solutions" by Valiant and Vazirani (I lost my digital copy of that article).
The zoo comes in handy when reading an article like this.
