The DOI matches its Crossref record; 16 of the 16 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
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
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
(1973) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(09)x7013-3 · Cited by 2,937
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-citationAlgorithm 457: finding all cliques of an undirected graph
Bron, C., & Kerbosch, J. (1973) · Communications of the ACM · doi:10.1145/362342.362367 · Cited by 2,452
Welsh, D. J. A. (1974) · Bulletin of the London Mathematical Society · doi:10.1112/blms/6.2.218b · Cited by 1,046
Dimer Statistics and Phase Transitions
Kasteleyn, P. W. (1963) · Journal of Mathematical Physics · doi:10.1063/1.1703953 · Cited by 946
(1973) · Elsevier eBooks · doi:10.1016/c2013-0-10826-4 · Cited by 834
Dimer problem in statistical mechanics-an exact result
Temperley, H. N. V., & Fisher, M. E. (1961) · Philosophical magazine · doi:10.1080/14786436108243366 · Cited by 802
Graph theory and theoretical physics
Harary, F. (1967) · Cited by 630
Applied Combinatorial Mathematics
Gilbert, E. N. (1965) · Technometrics · doi:10.1080/00401706.1965.10490279 · Cited by 224
A characterization of convertible (0, 1)-matrices
Little, C. H. C. (1975) · Journal of Combinatorial Theory Series B · doi:10.1016/0095-8956(75)90048-9 · Cited by 127
On counting problems and the polynomial-time hierarchy
Angluin, D. (1980) · Theoretical Computer Science · doi:10.1016/0304-3975(80)90027-4 · Cited by 70
On the relation between the determinant and the permanent
Marcus, M. D., & Minc, H. (1961) · Illinois Journal of Mathematics · doi:10.1215/ijm/1255630882 · Cited by 68
4. On a Class of Permanent Symmetric Functions
Muir, T. (1882) · Proceedings of the Royal Society of Edinburgh · doi:10.1017/s0370164600047593 · Cited by 11
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-citationScalable influence maximization for prevalent viral marketing in large-scale social networks
Chen, W., Wang, C., & Wang, Y. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835934 · Cited by 1,731
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
Efficient query evaluation on probabilistic databases
Dalvi, N., & Suciu, D. (2007) · The VLDB Journal · doi:10.1007/s00778-006-0004-3 · Cited by 962
Scalable Influence Maximization in Social Networks under the Linear Threshold Model
Chen, W., Yuan, Y., & Zhang, L. (2010) · 2010 IEEE International Conference on Data Mining · doi:10.1109/icdm.2010.118 · Cited by 924
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
- 16
- 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
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.