PP (complexity) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "PP (complexity)" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

low place

low place

69^th place

59^th place

18^th place

17^th place

2semanticscholar.org

11^th place

8^th place

1web.archive.org

1^st place

1^st place

low place

low place

451^st place

277^th place

207^th place

136^th place

1scottaaronson.com

low place

low place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Toda, Seinosuke (1991). "PP is as hard as the polynomial-time hierarchy". SIAM Journal on Computing. 20 (5): 865–877. doi:10.1137/0220053. MR 1115655.

arxiv.org (Global: 69^th place; English: 59^th place)

Aaronson, Scott (2005). "Quantum computing, postselection, and probabilistic polynomial-time". Proceedings of the Royal Society A. 461 (2063): 3473–3482. arXiv:quant-ph/0412187. Bibcode:2005RSPSA.461.3473A. doi:10.1098/rspa.2005.1546. S2CID 1770389.
Yamakami, Tomoyuki (1999). "Analysis of Quantum Functions". Int. J. Found. Comput. Sci. 14 (5): 815–852. arXiv:quant-ph/9909012. Bibcode:1999quant.ph..9012Y. doi:10.1142/S0129054103002047. S2CID 3265603.

doi.org (Global: 2^nd place; English: 2^nd place)

Gill, John (1977). "Computational Complexity of Probabilistic Turing Machines". SIAM Journal on Computing. 6 (4): 675–695. doi:10.1137/0206049.
Aaronson, Scott (2005). "Quantum computing, postselection, and probabilistic polynomial-time". Proceedings of the Royal Society A. 461 (2063): 3473–3482. arXiv:quant-ph/0412187. Bibcode:2005RSPSA.461.3473A. doi:10.1098/rspa.2005.1546. S2CID 1770389.
Toda, Seinosuke (1991). "PP is as hard as the polynomial-time hierarchy". SIAM Journal on Computing. 20 (5): 865–877. doi:10.1137/0220053. MR 1115655.
Yamakami, Tomoyuki (1999). "Analysis of Quantum Functions". Int. J. Found. Comput. Sci. 14 (5): 815–852. arXiv:quant-ph/9909012. Bibcode:1999quant.ph..9012Y. doi:10.1142/S0129054103002047. S2CID 3265603.

fortnow.com (Global: low place; English: low place)

weblog.fortnow.com

Lance Fortnow. Computational Complexity: Wednesday, September 4, 2002: Complexity Class of the Week: PP. http://weblog.fortnow.com/2002/09/complexity-class-of-week-pp.html
Aaronson, Scott (2004-01-11). "Complexity Class of the Week: PP". Computational Complexity Weblog. Retrieved 2008-05-02.

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Aaronson, Scott (2005). "Quantum computing, postselection, and probabilistic polynomial-time". Proceedings of the Royal Society A. 461 (2063): 3473–3482. arXiv:quant-ph/0412187. Bibcode:2005RSPSA.461.3473A. doi:10.1098/rspa.2005.1546. S2CID 1770389.
Yamakami, Tomoyuki (1999). "Analysis of Quantum Functions". Int. J. Found. Comput. Sci. 14 (5): 815–852. arXiv:quant-ph/9909012. Bibcode:1999quant.ph..9012Y. doi:10.1142/S0129054103002047. S2CID 3265603.

msu.su (Global: low place; English: low place)

lpcs.math.msu.su

"N.K. Vereshchagin, "On the Power of PP"". Archived from the original on 2014-12-29. Retrieved 2011-08-17.

psu.edu (Global: 207^th place; English: 136^th place)

citeseer.ist.psu.edu

R. Beigel, N. Reingold, and D. A. Spielman, "PP is closed under intersection", Proceedings of ACM Symposium on Theory of Computing 1991, pp. 1–9, 1991.

scottaaronson.com (Global: low place; English: low place)

Aaronson, Scott. "The Amazing Power of Postselection". Retrieved 2009-07-27.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Aaronson, Scott (2005). "Quantum computing, postselection, and probabilistic polynomial-time". Proceedings of the Royal Society A. 461 (2063): 3473–3482. arXiv:quant-ph/0412187. Bibcode:2005RSPSA.461.3473A. doi:10.1098/rspa.2005.1546. S2CID 1770389.
Yamakami, Tomoyuki (1999). "Analysis of Quantum Functions". Int. J. Found. Comput. Sci. 14 (5): 815–852. arXiv:quant-ph/9909012. Bibcode:1999quant.ph..9012Y. doi:10.1142/S0129054103002047. S2CID 3265603.

web.archive.org (Global: 1^st place; English: 1^st place)

"N.K. Vereshchagin, "On the Power of PP"". Archived from the original on 2014-12-29. Retrieved 2011-08-17.