Prime Numbers

568 REFERENCES
[Pomerance et al. 1988] C. Pomerance, J. Smith, and R. Tuler. A pipeline
architecture for factoring large integers with the quadratic sieve
algorithm. SIAM J. Comput., 17:387–403, 1988. Special issue on
cryptography.
[Prachar 1978] K. Prachar. Primzahlverteilung, volume 91 of Grundlehren der
Mathematischen Wissenschaften. Springer–Verlag, 1978. Reprint of the
1957 edition.
[Pratt 1975] V. Pratt. Every prime has a succinct certificate. SIAM J. Comput.,
4:214–220, 1975.
[Preskill 1999] J. Preskill. Course notes, Phys 229, Calif. Inst. of Tech., 1999.
www.theory.caltech.edu/people/preskill/ph229/.
[Press et al. 1996] W. Press, S. Teukolsky, W. Vettering, and B. Flannery.
Numerical Recipes in C. Cambridge University Press, 1996.
[Pritchard 1981] P. Pritchard. A sublinear additive sieve for finding prime
numbers. Comm. ACM, 24:18–23, 1981.
[Pritchard et al. 1995] P. Pritchard, A. Moran, and A. Thyssen. Twenty-two
primes in arithmetic progression. Math. Comp., 64:1337–1339, 1995.
[Purdom and Williams 1968] P. Purdom and J. Williams. Cycle length in a
random function. Trans. Amer. Math. Soc. 133:547–551, 1968.
[Pustyl’nkov 1999] L. Pustyl’nikov. On a property of the classical zeta-function
associated with the Riemann conjecture on zeros. Russian Math. Surveys,
54:162–163, 1999.
[Rabin 1976] M. Rabin. Probabilistic algorithms. In Algorithms and Complexity
(Proc. Sympos., Carnegie-Mellon Univ., Pittsburgh, PA, 1976), pages
21–39. Academic Press, 1976.
[Rabin 1980] M. Rabin. Probabilistic algorithm for testing primality. J. Number
Theory, 12:128–138, 1980.
[Ramaré 1995] O. Ramaré. On ˇ Snirel’man’s constant. Ann. Scuola Norm. Sup.
PisaCl.Sci.(4), 22:645–706, 1995.
[Ramaré and Rumely 1996] O. Ramaré and R. Rumely. Primes in arithmetic
progressions. Math. Comp., 65:397–425, 1996.
[Ribenboim 1994] P. Ribenboim. Catalan’s Conjecture: Are 8 and 9 the Only
Consecutive Powers? Academic Press, 1994.
[Ribenboim 1996] P. Ribenboim. The New Book of Prime Number Records.
Springer–Verlag, 1996.
[Richstein 2001] J. Richstein. Verifying the Goldbach conjecture up to 4 · 10 14 .
Math. Comp., 70:1745–1749, 2001.
[Riesel and Göhl 1970] H. Riesel and G. Göhl. Some calculations related to
Riemann’s prime number formula. Math. Comp., 24:969–983, 1970.
[Rishi et al. 1984] D. Rishi, J. Parnami, and A. Rajwade. Evaluation of a cubic
character sum using the √ −19 division points of the curve
Y 2 = X 3 − 2 3 · 19X +2· 19 2 . J. Number Theory, 19:184–194, 1984.