#P-complete Problems
#P-Complete Problems is a complexity class comprising computational problems that are at least as hard as the hardest problems in #P, where a problem is #P-complete if it is in #P and every problem in #P can be reduced to it via a polynomial-time counting reduction.
43
Publications
5.1K
Citations
74
Authors
49
Institutions
Publications per year
2017–2026
5
43
The Complexity of Enumeration and Reliability Problems
Leslie G. Valiant · SIAM Journal on Computing · 1979 · 2.1K citations
Limits to parallel computation: P-completeness theory
Choice Reviews Online · 1996 · 422 citations
The status of the P versus NP problem
Lance Fortnow · Communications of the ACM · 2009 · 325 citations
Performing Bayesian inference by weighted model counting
Tian Sang, Paul Bearne, Henry Kautz · 2005 · 223 citations
The complexity of approximate counting
Larry Stockmeyer · 1983 · 209 citations · Full text
1–5 of 43
74
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 74
49
Carnegie Mellon University
Pittsburgh, United States
3 h-index
4 publications
289 citations
California Institute of Technology
Pasadena, United States
2 h-index
2 publications
135 citations
University of Washington
Seattle, United States
2 h-index
4 publications
739 citations

Claremont McKenna College
Claremont, United States
2 h-index
2 publications
29 citations
Tsinghua University
Beijing, China
2 h-index
5 publications
149 citations
Harvard University
Cambridge, United States
2 h-index
2 publications
218 citations

University of Calabria
Rende, Italy
2 h-index
5 publications
272 citations
University of Wisconsin–Madison
Madison, United States
2 h-index
3 publications
99 citations
1–8 of 49
4 publications · 2.4K citations
4
h-index
3 publications · 81 citations
3
h-index
2 publications · 82 citations
2
h-index
Conference · 2 publications · 81 citations
2
h-index
2 publications · 41 citations
2
h-index
1–5