PH (complexity) (English Wikipedia)

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

refsWebsite

Global rank English rank

2^nd place

2^nd place

1semanticscholar.org

11^th place

8^th place

69^th place

59^th place

1weizmann.ac.il

4,983^rd place

8,002^nd place

1quantamagazine.org

6,413^th place

4,268^th place

arxiv.org

Aaronson, Scott (2009). "BQP and the Polynomial Hierarchy". Proc. 42nd Symposium on Theory of Computing (STOC 2009). Association for Computing Machinery. pp. 141–150. arXiv:0910.4698. doi:10.1145/1806689.1806711. ECCC TR09-104.

doi.org

Ferrarotti, Flavio; Van den Bussche, Jan; Virtema, Jonni (2018). "Expressivity Within Second-Order Transitive-Closure Logic". DROPS-IDN/V2/Document/10.4230/LIPIcs.CSL.2018.22. Schloss-Dagstuhl - Leibniz Zentrum für Informatik. doi:10.4230/LIPIcs.CSL.2018.22. S2CID 4903744.
Aaronson, Scott (2009). "BQP and the Polynomial Hierarchy". Proc. 42nd Symposium on Theory of Computing (STOC 2009). Association for Computing Machinery. pp. 141–150. arXiv:0910.4698. doi:10.1145/1806689.1806711. ECCC TR09-104.

quantamagazine.org

Hartnett, Kevin (21 June 2018). "Finally, a Problem That Only Quantum Computers Will Ever Be Able to Solve". Quanta Magazine.

semanticscholar.org

api.semanticscholar.org

Ferrarotti, Flavio; Van den Bussche, Jan; Virtema, Jonni (2018). "Expressivity Within Second-Order Transitive-Closure Logic". DROPS-IDN/V2/Document/10.4230/LIPIcs.CSL.2018.22. Schloss-Dagstuhl - Leibniz Zentrum für Informatik. doi:10.4230/LIPIcs.CSL.2018.22. S2CID 4903744.

weizmann.ac.il

eccc.weizmann.ac.il

Aaronson, Scott (2009). "BQP and the Polynomial Hierarchy". Proc. 42nd Symposium on Theory of Computing (STOC 2009). Association for Computing Machinery. pp. 141–150. arXiv:0910.4698. doi:10.1145/1806689.1806711. ECCC TR09-104.