CoChat

The DOI matches its Crossref record; 30 of the 31 references it cites were found in a registry or an index.

The complexity of computing the permanent

Open access
Valiant, L.G. · 1979 · Theoretical Computer Science

Abstract

It is shown that the permanent function of (0, 1)-matrices is a complete problem for the class of counting problems associated with nondeterministic polynomial time computations. Related counting problems are also considered. The reductions used are characterized by their nontrivial use of arithmetic.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/0304-3975(79)90044-6

Cites

30 of 30 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

Show all 30 references

Research works printed but not linked: 2

  1. Polya, 1913, Aufgabe 424, Arch. Math. Phys., 20, 27
  2. Simon, 1977, On the difference between one and many, Proc. 4th Colloq. on Automata, Languages and Programming

Cited by

See all 2,705

Metadata

Authors
Valiant, L. G.
Affiliations
University of Edinburgh (GB)
Corresponding author
Valiant, L.G.
Venue
Theoretical Computer Science
Publisher
Elsevier BV
Published
1979
Volume
8
Issue
2
Pages
189-201
ISSN
0304-3975 (ISSN-L)
OpenAlex
W2006912660
Cited by
2,705
References
31
Citations by year
2026: 42 · 2025: 64 · 2024: 88 · 2023: 92 · 2022: 81 · 2021: 134 · 2020: 114 · 2019: 129 · 2018: 105 · 2017: 111 · 2016: 95 · 2015: 92 · 2014: 129 · 2013: 109 · 2012: 119
FWCI
13.81
Type
journal article
Language
en
Open access
Licence
Locations
  • Theoretical Computer Science (publishedVersion)
  • ACM eBooks (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
Keywords
permanent, counting complexity, #P-completeness, nondeterministic polynomial time, counting problems, binary matrices, computational complexity

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: The complexity of computing the permanent. https://app.cochat.ai/papers/10.1016/0304-3975(79)90044-6
The paper
Valiant, L. G. (1979). The complexity of computing the permanent. Theoretical Computer Science. https://doi.org/10.1016/0304-3975(79)90044-6

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.