BQP (complessità) (Italian Wikipedia)

Analysis of information sources in references of the Wikipedia article "BQP (complessità)" in Italian language version.

refsWebsite

Global rank Italian rank

69^th place

235^th place

2^nd place

7^th place

230^th place

353^rd place

5^th place

26^th place

4,963^rd place

325^th place

580^th place

1,138^th place

799^th place

22^nd place

low place

low place

arxiv.org (Global: 69^th place; Italian: 235^th place)

arXiv:quant-ph/9508027v2 Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, Peter W. Shor
Scott Aaronson, Quantum computing, postselection, and probabilistic polynomial-time, in Proceedings of the Royal Society A, vol. 461, n. 2063, 2005, 3473–3482, DOI:10.1098/rspa.2005.1546. Prestampa disponibile su [2]

berkeley.edu (Global: 580^th place; Italian: 1,138^th place)

cs.berkeley.edu

Bernstein and Vazirani, Quantum complexity theory, SIAM Journal on Computing, 26(5):1411-1473, 1997. [1]

doi.org (Global: 2^nd place; Italian: 7^th place)

dx.doi.org

Lance Fortnow e John Rogers, Complexity limitations on Quantum computation (PDF), in J. Comput. Syst. Sci., vol. 59, n. 2, Boston, MA, Academic Press, 1999, 240–252, DOI:10.1006/jcss.1999.1651, ISSN 0022-0000 (WC · ACNP).
Scott Aaronson, Quantum computing, postselection, and probabilistic polynomial-time, in Proceedings of the Royal Society A, vol. 461, n. 2063, 2005, 3473–3482, DOI:10.1098/rspa.2005.1546. Prestampa disponibile su [2]

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

weblog.fortnow.com

Scott Aaronson, Complexity Class of the Week: PP, su Computational Complexity Weblog, 11 gennaio 2004. URL consultato il 2 maggio 2008.

oadoi.org (Global: 799^th place; Italian: 22^nd place)

Scott Aaronson, Quantum computing, postselection, and probabilistic polynomial-time, in Proceedings of the Royal Society A, vol. 461, n. 2063, 2005, 3473–3482, DOI:10.1098/rspa.2005.1546. Prestampa disponibile su [2]

uchicago.edu (Global: 230^th place; Italian: 353^rd place)

people.cs.uchicago.edu

Lance Fortnow e John Rogers, Complexity limitations on Quantum computation (PDF), in J. Comput. Syst. Sci., vol. 59, n. 2, Boston, MA, Academic Press, 1999, 240–252, DOI:10.1006/jcss.1999.1651, ISSN 0022-0000 (WC · ACNP).

unibo.it (Global: 4,963^rd place; Italian: 325^th place)

acnpsearch.unibo.it

Lance Fortnow e John Rogers, Complexity limitations on Quantum computation (PDF), in J. Comput. Syst. Sci., vol. 59, n. 2, Boston, MA, Academic Press, 1999, 240–252, DOI:10.1006/jcss.1999.1651, ISSN 0022-0000 (WC · ACNP).

worldcat.org (Global: 5^th place; Italian: 26^th place)

Lance Fortnow e John Rogers, Complexity limitations on Quantum computation (PDF), in J. Comput. Syst. Sci., vol. 59, n. 2, Boston, MA, Academic Press, 1999, 240–252, DOI:10.1006/jcss.1999.1651, ISSN 0022-0000 (WC · ACNP).