Prime Numbers

References
[Adleman and Huang 1992] L. Adleman and M.-D. Huang. Primality testing and
abelian varieties over finite fields, volume 1512 of Lecture Notes in
Mathematics. Springer–Verlag, 1992.
[Adleman 1994] L. Adleman. The function field sieve. In L. Adleman and M.-D.
Huang, editors, Algorithmic Number Theory: Proc. ANTS-I, Ithaca, NY,
volume 877 of Lecture Notes in Computer Science, pages 108–121.
Springer–Verlag, 1994.
[Adleman and Lenstra] L. Adleman and H. Lenstra, Jr. Finding irreducible
polynomials over finite fields. In Proc. 18th Annual ACM Symposium on
the Theory of Computing, pages 350–355, 1986.
[Adleman et al. 1983] L. Adleman, C. Pomerance, and R. Rumely. On
distinguishing prime numbers from composite numbers. Ann. of Math.,
117:173–206, 1983.
[Agarwal and Cooley 1986] R. Agarwal and J. Cooley. Fourier transform and
convolution subroutines for the IBM 3090 vector facility. IBM Journal of
Research and Development, 30:145–162, 1986.
[Agrawal 2003] M. Agrawal. PRIMES is in P.
http://www.fields.utoronto.ca/audio/02-03/agrawal/agrawal/.
[Agrawal et al. 2002] M. Agrawal, N. Kayal, and N. Saxena. PRIMES is in P.
http://www.cse.iitk.ac.in/news/primality.html.
[Agrawal et al. 2004] M. Agrawal, N. Kayal, and N. Saxena. PRIMES is in P.
Ann. of Math., 160:781–793, 2004.
[Aho et al. 1974] A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of
Computer Algorithms. Addison-Wesley, 1974.
[Alford et al. 1994a] W. Alford, A. Granville, and C. Pomerance. There are
infinitely many Carmichael numbers. Ann. of Math., 139:703–722, 1994.
[Alford et al. 1994b] W. Alford, A. Granville, and C. Pomerance. On the difficulty
of finding reliable witnesses. In L. Adleman and M.-D. Huang, editors,
Algorithmic Number Theory: Proc. ANTS-I, Ithaca, NY, volume 877 of
Lecture Notes in Computer Science, pages 1–16. Springer–Verlag, 1994.
[Alford and Pomerance 1995] W. Alford and C. Pomerance. Implementing the
self-initializing quadratic sieve on a distributed network. In
Number-theoretic and algebraic methods in computer science (Moscow,
1993), pages 163–174. World Scientific, 1995.
[Alt 1979] H. Alt. Square rooting is as difficult as multiplication. Computing,
21:221–232, 1979.