The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
NP is as easy as detecting unique solutions
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Self-citation
Cited by
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
A survey and annotated bibliography of multiobjective combinatorial optimization
Ehrgott, M., & Gandibleux, X. (2000) · OR Spectrum · doi:10.1007/s002910000046 · Cited by 699
Karchmer, M., & Wigderson, A. (2002) · [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference · doi:10.1109/sct.1993.336536 · Cited by 486
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
Valiant, L. G. (2002) · SIAM Journal on Computing · doi:10.1137/s0097539700377025 · Cited by 311
Self-citationGraph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
Klivans, A. R., & van Melkebeek, D. (2002) · SIAM Journal on Computing · doi:10.1137/s0097539700389652 · Cited by 270
Metadata
- Authors
- Valiant, L. G., & Vazirani, V. V.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 1986
- Volume
- 47
- Pages
- 85-93
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2057512592
- Cited by
- 635
- References
- 2
- FWCI
- 5.73
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: NP is as easy as detecting unique solutions. https://app.cochat.ai/papers/10.1016/0304-3975(86)90135-0
- The paper
- Valiant, L. G., & Vazirani, V. V. (1986). NP is as easy as detecting unique solutions. Theoretical Computer Science. https://doi.org/10.1016/0304-3975(86)90135-0
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
