PostBQP (Portuguese Wikipedia)
Analysis of information sources in references of the Wikipedia article "PostBQP" in Portuguese language version.
refsWebsite
Global rank
Portuguese rank
low place
low place
arxiv.org (Global: 69th place; Portuguese: 195th place)
- Aaronson, Scott (2005). «Quantum computing, postselection, and probabilistic polynomial-time». Proceedings of the Royal Society A. 461 (2063): 3473–3482. doi:10.1098/rspa.2005.1546. Preprint available at [1]
- Aaronson, Scott (2005). «Quantum computing, postselection, and probabilistic polynomial-time». Proceedings of the Royal Society A. 461 (2063): 3473–3482. arXiv:quant-ph/0412187
. doi:10.1098/rspa.2005.1546
doi.org (Global: 2nd place; Portuguese: 4th place)
dx.doi.org
- Y. Han and Hemaspaandra, L. and Thierauf, T. (1997). «Threshold computation and cryptographic security». SIAM Journal on Computing. 26: 59–78. doi:10.1137/S0097539792240467
- Aaronson, Scott (2005). «Quantum computing, postselection, and probabilistic polynomial-time». Proceedings of the Royal Society A. 461 (2063): 3473–3482. doi:10.1098/rspa.2005.1546. Preprint available at [1]
- Ethan Bernstein & Umesh Vazirani (1997). «Quantum Complexity Theory». SIAM Journal on Computing. 26: 11–20. doi:10.1137/s0097539796300921
- Aaronson, Scott (2005). «Quantum computing, postselection, and probabilistic polynomial-time». Proceedings of the Royal Society A. 461 (2063): 3473–3482. arXiv:quant-ph/0412187. doi:10.1098/rspa.2005.1546
fortnow.com (Global: low place; Portuguese: low place)
weblog.fortnow.com
- Aaronson, Scott (11 de janeiro de 2004). «Complexity Class of the Week: PP». Computational Complexity Weblog. Consultado em 2 de maio de 2008