Prime Numbers

552 REFERENCES
[Buchmann et al. 1997] J. Buchmann, M. Jacobson, Jr., and E. Teske. On some
computational problems in finite groups. Math. Comp., 66:1663–1687,
1997.
[Buell and Young 1988] D. Buell and J. Young. The twentieth Fermat number is
composite. Math. Comp., 50:261–263, 1988.
[Buhler 1991] J. Buhler, 1991. Private communication.
[Buhler 1998] J. Buhler, editor. Algorithmic Number Theory: Proc. ANTS-III,
Portland, OR, volume 1423 of Lecture Notes in Computer Science.
Springer–Verlag, 1998.
[Buhler 2000] J. Buhler, R. Crandall, R. Ernvall, T. Metsänkylä, and
M. Shokrollahi. Irregular primes and cyclotomic invariants to 12 million.
J. Symbolic Comput., 11:1–8, 2000.
[Buhler et al. 1993] J. Buhler, H. Lenstra, Jr., and C. Pomerance. Factoring
integers with the number field sieve. In A. Lenstra and H. Lenstra, Jr.,
editors, The development of the number field sieve, volume 1554 of
Lecture Notes in Mathematics, pages 50–94. Springer–Verlag, 1993.
[Bürgisser et al. 1997] P. Bürgisser, M. Clausen, and M. Shokrollahi. Algebraic
Complexity Theory. Springer–Verlag, 1997.
[Burnikel and Ziegler 1998] C. Burnikel and J. Ziegler. Fast recursive division.
Max-Planck-Institut für Informatik Research Report MPI-I-98-1-022,
1998.
http:www.algorilla.de/Download/FastRecursiveDivision.ps.gz.
[Burthe 1996] R. Burthe. Further investigations with the strong probable prime
test. Math. Comp., 65:373–381, 1996.
[Burthe 1997] R. Burthe. Upper bounds for least witnesses and generating sets.
Acta Arith., 80:311–326, 1997.
[Caldwell 1999] C. Caldwell. Website for prime numbers, 1999.
http://primes.utm.edu/.
[Canfield et al. 1983] E. Canfield, P. Erdős, and C. Pomerance. On a problem of
Oppenheim concerning “factorisatio numerorum”. J. Number Theory,
17:1–28, 1983.
[Cassels 1966] J. Cassels. Diophantine equations with special reference to elliptic
curves. J. London Math. Soc., 41:193–291, 1966.
[Cesari 1998] G. Cesari. Parallel implementation of Schönhage’s integer GCD
algorithm. In [Buhler 1998], pages 64–76.
[Chen 1966] J. Chen. On the representation of a large even integer as the sum of a
prime and the product of at most two primes. Kexue Tongbao,
17:385–386, 1966.
[Cochrane 1987] T. Cochrane. On a trigonometric inequality of Vinogradov. J.
Number Theory, 27:9–16, 1987.
[Cohen 2000] H. Cohen. A Course in Computational Algebraic Number Theory,
volume 138 of Graduate Texts in Mathematics. Springer–Verlag, 2000.