1. Bailey, D.H. 1988. The computation of ? to 29,360,000 decimal digits using Borweins' quartically convergent algorithm. Mathematics of Computation, 50: 283?296.
2. Borodin, A., and Munro, I. 1975. The Computational Complexity of Algebraic and Numeric Problems. American Elsevier, New York.
3. Knuth, D.E. 1981. The Art of Computer Programming, vol. 2, Seminumerical Algorithms, 2nd ed. Addison-Wesley, Reading, Mass. pp. 178ff.
4. Lehmer, D.H. 1969. Computer technology applied to the theory of numbers. In MAA Studies in Mathematics, vol. 6, Studies in Number Theory. Mathematical Association of America, Washington, D.C. pp. 117?151.
5. Montgomery, P.L. 1985. Modular multiplication without trial division. Mathematics of Computation, 44: 519?521.