NP is as easy as detecting unique solutions
Open Access
- 1 January 1986
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 47, 85-93
- https://doi.org/10.1016/0304-3975(86)90135-0
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Hard-core theorems for complexity classesJournal of the ACM, 1985
- The complexity of promise problems with applications to public-key cryptographyInformation and Control, 1984
- The complexity of facets (and some facets of complexity)Journal of Computer and System Sciences, 1984
- A natural encoding scheme proved probabilistic polynomial completeTheoretical Computer Science, 1983
- On the unique satisfiability problemInformation and Control, 1982
- Relativized Questions Involving Probabilistic AlgorithmsJournal of the ACM, 1982
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- The complexity of computing the permanentTheoretical Computer Science, 1979
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- Relative complexity of checking and evaluatingInformation Processing Letters, 1976