rich@jvncf.csc.org..csc.org (Seth I. Rich) (07/24/87)
Earlier today, I posted a list of references for research on Primeness, with a request to E-Mail me any corrections or missing information. Since I got a bunch more references, I post them here too, with the same request. Please note that whatever our rather cranky mail program says, my address is as follows: rich@jvncf.csc.org New respondants: Greg Nowak, Bennet Yee, Mark Fulk, David Eppstein There's always something about modularity tests...the ones that Carmichael numbers are an exception to...but there are ways to beef that up. (Look - I only type them...I don't try to understand them.) There are various high-precision software packages available that would prove necessary for this sort of research. Gary L. Miller, "Riemann's Hypothesis and Tests for Primality", Journal of Computer and System Sciences, 13, 300-317 (1976) Shafi Goldwater and Joe Killian, "Almost All Primes Can Be Quickly Certified", ACM Symposium on the Theory of Computing, 1986, pp. 316-329 Leonard M. Adleman and Ming-Deh Huang, "Recognizing Primes in Random Polynomial Time", Proc. 19th ACM Symp. Theory of Computing, 1987, pp 462-469 L. M. Adleman, C. Pomerance, and R. S. Rumely, "On Distinguishing Prime Numbers from Composite Numbers", Annals of Math, 117, 1983, pp 173-206 Also, there's word that good stuff along this line is being done at Chicago. I don't yet have any information on that topic. I'm looking forward to hearing from you if there's anything you have to offer. Thanks much. - Seth I. Rich