NP Might Not Be As Easy As Detecting Unique Solutions. Beigel, R., Buhrman, H., & Fortnow, L. In Proceedings of the 30th ACM Symposium on the Theory of Computing, pages 203-208. ACM, New York, 1998.
NP Might Not Be As Easy As Detecting Unique Solutions [link]Paper  NP Might Not Be As Easy As Detecting Unique Solutions [pdf]Paper  doi  bibtex   2 downloads  

Downloads: 2