P/poly (Spanish Wikipedia)

Analysis of information sources in references of the Wikipedia article "P/poly" in Spanish language version.

refsWebsite

Global rank Spanish rank

2^nd place

2^nd place

2web.archive.org

1^st place

1^st place

1au.dk

8,222^nd place

low place

1,379^th place

569^th place

2,869^th place

4,521^st place

230^th place

247^th place

7,948^th place

9,308^th place

1,708^th place

2,618^th place

1,045^th place

1,052^nd place

au.dk

daimi.au.dk

«Lecture notes on computational complexity by Peter Bro Miltersen». Archivado desde el original el 23 de febrero de 2012. Consultado el 25 de diciembre de 2009.

doi.org

dx.doi.org

Lutz, Jack H.; Schmidt, William J. (1993), «Circuit size relative to pseudorandom oracles», Theoretical Computer Science 107 (1): 95-119, doi:10.1016/0304-3975(93)90256-S .
Arvind, Vikraman; Köbler, Johannes; Schöning, Uwe; Schuler, Rainer (1995), «If NP has polynomial-size circuits, then MA = AM», Theoretical Computer Science 137 (2): 279-282, doi:10.1016/0304-3975(95)91133-B .
Babai, László; Fortnow, Lance; Lund, Carsten (1991), «Nondeterministic exponential time has two-prover interactive protocols», Computational Complexity 1 (1): 3-40, doi:10.1007/BF01200056, archivado desde el original el 31 de marzo de 2012, consultado el 2 de octubre de 2011 .
Impagliazzo, Russell; Kabanets, Valentine; Wigderson, Avi (2002), «In search of an easy witness: exponential time vs. probabilistic polynomial time», Journal of Computer and System Sciences 65 (4): 672-694, doi:10.1016/S0022-0000(02)00024-7 .
Adleman, L. M. (1978), «Two theorems on random polynomial time», Proceedings of the Nineteenth Annual IEEE Symposium on Foundations of Computer Science, pp. 75-83, doi:10.1109/SFCS.1978.37 .

hu-berlin.de

informatik.hu-berlin.de

Arvind, Vikraman; Köbler, Johannes; Schöning, Uwe; Schuler, Rainer (1995), «If NP has polynomial-size circuits, then MA = AM», Theoretical Computer Science 137 (2): 279-282, doi:10.1016/0304-3975(95)91133-B .

ias.edu

math.ias.edu

Impagliazzo, Russell; Kabanets, Valentine; Wigderson, Avi (2002), «In search of an easy witness: exponential time vs. probabilistic polynomial time», Journal of Computer and System Sciences 65 (4): 672-694, doi:10.1016/S0022-0000(02)00024-7 .

uchicago.edu

cs.uchicago.edu

Babai, László; Fortnow, Lance; Lund, Carsten (1991), «Nondeterministic exponential time has two-prover interactive protocols», Computational Complexity 1 (1): 3-40, doi:10.1007/BF01200056, archivado desde el original el 31 de marzo de 2012, consultado el 2 de octubre de 2011 .

unl.edu

cse.unl.edu

A Note on the Karp-Lipton Collapse for the Exponential Hierarchy

utm.edu

primes.utm.edu

Finding primes & proving primality

web.archive.org

«Lecture notes on computational complexity by Peter Bro Miltersen». Archivado desde el original el 23 de febrero de 2012. Consultado el 25 de diciembre de 2009.
Babai, László; Fortnow, Lance; Lund, Carsten (1991), «Nondeterministic exponential time has two-prover interactive protocols», Computational Complexity 1 (1): 3-40, doi:10.1007/BF01200056, archivado desde el original el 31 de marzo de 2012, consultado el 2 de octubre de 2011 .

wisc.edu

pages.cs.wisc.edu

Jin-Yi Cai. Lecture 11: P/poly, Sparse Sets, and Mahaney's Theorem. CS 810: Introduction to Complexity Theory. The University of Wisconsin–Madison. September 18, 2003.