Np might not be as easy as detecting unique solutions (1998)

by Richard Beigel, Harry Buhrman, Lance Fortnow
Venue:In STOC ’98: Proceedings of the thirtieth annual ACM symposium on Theory of computing