BPP (complessità) (Italian Wikipedia)

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

refsWebsite
Global rank Italian rank
1st place
1st place
3,413th place
4,150th place
415th place
913th place
179th place
499th place
5th place
26th place
4,963rd place
325th place
2nd place
7th place

doi.org

dx.doi.org

  • Russell Impagliazzo and Avi Wigderson (1997). "P = BPP if E requires exponential circuits: Derandomizing the XOR Lemma". Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 220–229. DOI10.1145/258533.258590

mit.edu

people.csail.mit.edu

sfu.ca

cs.sfu.ca

stanford.edu

qwiki.stanford.edu

unibo.it

acnpsearch.unibo.it

  • Charles H. Bennett e John Gill, Relative to a Random Oracle A, P^A != NP^A != co-NP^A with Probability 1, in SIAM Journal on Computing, vol. 10, n. 1, 1981, pp. 96–113, ISSN 1095-7111 (WC · ACNP).

web.archive.org

worldcat.org

  • Charles H. Bennett e John Gill, Relative to a Random Oracle A, P^A != NP^A != co-NP^A with Probability 1, in SIAM Journal on Computing, vol. 10, n. 1, 1981, pp. 96–113, ISSN 1095-7111 (WC · ACNP).