♯P-complete (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "♯P-complete" in English language version.

refsWebsite
Global rank English rank
2nd place
2nd place
1,564th place
1,028th place
11th place
8th place

cmu.edu

math.cmu.edu

  • Valiant, Leslie G. (August 1979). "The Complexity of Enumeration and Reliability Problems" (PDF). SIAM Journal on Computing. 8 (3): 410–421. doi:10.1137/0208032.

doi.org

  • Valiant, Leslie G. (August 1979). "The Complexity of Enumeration and Reliability Problems" (PDF). SIAM Journal on Computing. 8 (3): 410–421. doi:10.1137/0208032.
  • Brightwell, Graham R.; Winkler, Peter (1991). "Counting linear extensions". Order. 8 (3): 225–242. doi:10.1007/BF00383444. S2CID 119697949..
  • Leslie G. Valiant (1979). "The Complexity of Computing the Permanent". Theoretical Computer Science. 8 (2). Elsevier: 189–201. doi:10.1016/0304-3975(79)90044-6.
  • Mark R. Jerrum; Leslie G. Valiant; Vijay V. Vazirani (1986). "Random Generation of Combinatorial Structures from a Uniform Distribution". Theoretical Computer Science. 43. Elsevier: 169–188. doi:10.1016/0304-3975(86)90174-x.

semanticscholar.org

api.semanticscholar.org