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 ]
- E. Bach and J. Shallit, Algorithmic number theory, Foundations of Computing Vol, I: Efficient Algorithms, The MIT Press, Cambridge, MA, 1996. pp. xvi+512, MR 97e:11157 [This book is an impressive summary of algorithmic number theory, and is the first of a proposed two volume set. This volume focuses on problems for which relatively efficient solutions exist--including factorization, primality testing and understanding the distribution of primes. The target audience ranges from beginning graduate student to experts in the field. An exceptional book!]