P/poly (English Wikipedia)

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

refsWebsite

Global rank English rank

7doi.org

2^nd place

5ams.org

451^st place

277^th place

2web.archive.org

1^st place

1au.dk

8,222^nd place

8,022^nd place

1weizmann.ac.il

4,983^rd place

8,002^nd place

1utm.edu

1,379^th place

1,175^th place

1zbmath.org

1,923^rd place

1,068^th place

1hu-berlin.de

2,869^th place

4,557^th place

1uchicago.edu

230^th place

214^th place

1ias.edu

7,948^th place

5,350^th place

1unl.edu

1,708^th place

1,051^st place

1wisc.edu

1,045^th place

746^th place

1cornell.edu

332^nd place

246^th place

ams.org

mathscinet.ams.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, MR 1201167
Jaeschke, Gerhard (1993), "On strong pseudoprimes to several bases", Mathematics of Computation, 61 (204): 915–926, doi:10.2307/2153262, MR 1192971; see p. 926.
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, MR 1311226
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, MR 1113533, archived from the original on 2012-03-31, retrieved 2011-10-02
Impagliazzo, Russell; Kabanets, Valentine; Wigderson, Avi (2002), "In search of an easy witness: exponential time vs. probabilistic polynomial time" (PDF), Journal of Computer and System Sciences, 65 (4): 672–694, doi:10.1016/S0022-0000(02)00024-7, MR 1964649

au.dk

daimi.au.dk

Lecture notes on computational complexity by Peter Bro Miltersen (PDF), archived from the original (PDF) on 2012-02-23, retrieved 2009-12-25

cornell.edu

cs.cornell.edu

Charles H. Bennett, John Gill. Relative to a Random Oracle A, P^A ≠ NP^A ≠ co-NP^A with probability 1. [1]

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, MR 1201167
Goldreich, Oded; Wigderson, Avi (2002), "Derandomization that is rarely wrong from short advice that is typically good", in Rolim, José D. P.; Vadhan, Salil P. (eds.), Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings, Lecture Notes in Computer Science, vol. 2483, Springer, pp. 209–223, doi:10.1007/3-540-45726-7_17, ECCC TR02-39
Jaeschke, Gerhard (1993), "On strong pseudoprimes to several bases", Mathematics of Computation, 61 (204): 915–926, doi:10.2307/2153262, MR 1192971; see p. 926.
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, MR 1311226
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, MR 1113533, archived from the original on 2012-03-31, retrieved 2011-10-02
Impagliazzo, Russell; Kabanets, Valentine; Wigderson, Avi (2002), "In search of an easy witness: exponential time vs. probabilistic polynomial time" (PDF), Journal of Computer and System Sciences, 65 (4): 672–694, doi:10.1016/S0022-0000(02)00024-7, MR 1964649
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, MR 1311226

ias.edu

math.ias.edu

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

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, MR 1113533, archived from the original on 2012-03-31, retrieved 2011-10-02

unl.edu

cse.unl.edu

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

utm.edu

primes.utm.edu

Caldwell, Chris, "2.3: Strong probable-primality and a practical test", Finding primes & proving primality

web.archive.org

Lecture notes on computational complexity by Peter Bro Miltersen (PDF), archived from the original (PDF) on 2012-02-23, retrieved 2009-12-25
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, MR 1113533, archived from the original on 2012-03-31, retrieved 2011-10-02

weizmann.ac.il

eccc.weizmann.ac.il

Goldreich, Oded; Wigderson, Avi (2002), "Derandomization that is rarely wrong from short advice that is typically good", in Rolim, José D. P.; Vadhan, Salil P. (eds.), Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings, Lecture Notes in Computer Science, vol. 2483, Springer, pp. 209–223, doi:10.1007/3-540-45726-7_17, ECCC TR02-39

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.

zbmath.org

Arora, Sanjeev; Barak, Boaz (2009), Computational complexity. A modern approach, Cambridge University Press, ISBN 978-0-521-42426-4, Zbl 1193.68112