♯P (English Wikipedia)

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

refsWebsite

Global rank English rank

2^nd place

2^nd place

741^st place

577^th place

1web.archive.org

1^st place

1^st place

1,151^st place

930^th place

doi.org

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.
Stockmeyer, Larry (November 1985). "On Approximation Algorithms for #P" (PDF). SIAM Journal on Computing. 14 (4): 849–861. doi:10.1137/0214060. Archived from the original (PDF) on October 28, 2009.

geocities.com

Stockmeyer, Larry (November 1985). "On Approximation Algorithms for #P" (PDF). SIAM Journal on Computing. 14 (4): 849–861. doi:10.1137/0214060. Archived from the original (PDF) on October 28, 2009.

princeton.edu

cs.princeton.edu

Barak, Boaz (Spring 2006). "Complexity of counting" (PDF). Computer Science 522: Computational Complexity. Princeton University.

web.archive.org

Stockmeyer, Larry (November 1985). "On Approximation Algorithms for #P" (PDF). SIAM Journal on Computing. 14 (4): 849–861. doi:10.1137/0214060. Archived from the original (PDF) on October 28, 2009.