Generalized Riemann hypothesis (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Generalized Riemann hypothesis" in English language version.

refsWebsite

Global rank English rank

2^nd place

26^th place

20^th place

69^th place

59^th place

3^rd place

11^th place

8^th place

arxiv.org

Ivanyos, Gabor; Karpinski, Marek; Saxena, Nitin (2009). "Schemes for deterministic polynomial factoring". Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISAAC). pp. 191–198. arXiv:0804.1974. doi:10.1145/1576702.1576730. ISBN 9781605586090. S2CID 15895636.
p5. Helfgott, Harald (2013). "Major arcs for Goldbach's theorem". arXiv:1305.2897 [math.NT].

Davenport, Harold (2000). Multiplicative Number Theory. Graduate Texts in Mathematics. Vol. 74. Revised and with a preface by Hugh L. Montgomery (Third ed.). New York: Springer-Verlag. p. 124. ISBN 0-387-95097-4.

Bach, Eric (1990). "Explicit bounds for primality testing and related problems". Mathematics of Computation. 55 (191): 355–380. doi:10.2307/2008811. JSTOR 2008811.
Ivanyos, Gabor; Karpinski, Marek; Saxena, Nitin (2009). "Schemes for deterministic polynomial factoring". Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISAAC). pp. 191–198. arXiv:0804.1974. doi:10.1145/1576702.1576730. ISBN 9781605586090. S2CID 15895636.
Shoup, Victor (1992). "Searching for primitive roots in finite fields". Mathematics of Computation. 58 (197): 369–380. doi:10.2307/2153041. JSTOR 2153041.

Ivanyos, Gabor; Karpinski, Marek; Saxena, Nitin (2009). "Schemes for deterministic polynomial factoring". Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISAAC). pp. 191–198. arXiv:0804.1974. doi:10.1145/1576702.1576730. ISBN 9781605586090. S2CID 15895636.