The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
The Complexity of Enumeration and Reliability Problems
Abstract
The class of $# P$-complete problems is a class of computationally eqivalent counting problems (defined by the author in a previous paper) that are at least as difficult as the $NP$-complete problems. Here we show, for a large number of natural counting problems for which there was no previous indication of intractability, that they belong to this class. The technique used is that of polynomial time reduction with oracles via translations that are of algebraic or arithmetic nature.
Overview
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
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-citationInfluence Maximization on Social Graphs: A Survey
Li, Y., Fan, J., Wang, Y., & Tan, K.-L. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2807843 · Cited by 659
The computational complexity of abduction
Bylander, T., Allemang, D., Tanner, M. C., & Josephson, J. R. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90005-5 · Cited by 406
Some NP-Complete Problems Similar to Graph Isomorphism
Lubiw, A. (1981) · SIAM Journal on Computing · doi:10.1137/0210002 · Cited by 144
A Review on Optimal Energy Management of Multimicrogrid System Considering Uncertainties
Ma, G., Li, J., & Zhang, X.-P. (2022) · IEEE Access · doi:10.1109/access.2022.3192638 · Cited by 65
Metadata
- Authors
- Valiant, L. G.
- Venue
- SIAM Journal on Computing
- Published
- 1979-08
- Volume
- 8
- Issue
- 3
- Pages
- 410-421
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2115826669
- Cited by
- 2,076
- References
- 2
- FWCI
- 12.31
- Type
- journal article
- Language
- en
- Open access
- closed
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 Enumeration and Reliability Problems. https://app.cochat.ai/papers/10.1137/0208032
- The paper
- Valiant, L. G. (1979). The Complexity of Enumeration and Reliability Problems. SIAM Journal on Computing. https://doi.org/10.1137/0208032
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.
