1. L. M. Adleman, On distinguishing prime numbers from composite numbers, Proc. 21-st IEEE Symp. on Foundations of Computer Science, 1980, 387–406.
2. L. M. Adleman, C. Pomerance, and R. S. Rumely, On distinguishing prime numbers from composite numbers, Annals of Math., to appear.
3. A. Aho, J. Hopcroft, and J. Ullmann, The Design and Analysis of Computer Algorithms, Addison-Wesley Publ. Co., Reading, Mass. 1974.
4. J. Bohman, On the number of primes less than a given limit, BIT 12 (1972), 576–577.
5. L. E. Dickson, History of the Theory of Numbers, Chelsea reprint. Vol. 1, Chapter XVIII.