Home
Search Site
Largest
Finding
How Many?
Mersenne
Glossary
Prime Curios!
e-mail list
FAQ
Prime Lists
Titans
Submit primes
|
This is the Prime Pages'
interface to our BibTeX database. Rather than being an exhaustive database,
it just lists the references we cite on these pages. Please let me know of any errors you notice.References: [ Home | Author index | Key index | Search ] All items with author Adleman (sorted by date)
- Adleman80
- L. M. Adleman, On distinguishing prime numbers from composite numbers. In "Proc. 21st Ann. Symp. Found. Comput. Sci.," 1980. pp. 387--406,
- AL81
- L. M. Adleman and F. T. Leighton, "An O(n1/10.89) primality testing algorithm," Math. Comp., 36:153 (1981) 261--266. MR 82c:10009
- APR83
- L. M. Adleman, C. Pomerance and R. S. Rumely, "On distinguishing prime numbers from composite numbers," Ann. Math., 117:1 (1983) 173--206. MR 84e:10008 [The first of the modern primality tests.]
- AGP94a
- W. R. Alford, A. Granville and C. Pomerance, On the difficulty of finding reliable witnesses. In "Algorithmic Number Theory, First International Symposium, ANTS-I," L. M. Adleman and M. D. Huang editors, Lecture Notes in Computer Science Vol, 877, Springer-Verlag, 1994. Berlin, pp. 1--16, MR 96d:11136
|
