I present a thorough examination of the unconditional deterministic polynomial-time algorithm for determining whether an input number is prime or composite prop

A self-contained treatment of theoretically and practically important efficient algorithms for the primality problem. The text covers the randomized algorithms

This book is devoted to algorithms for the venerable primality problem: Given a natural number n, decide whether it is prime or composite. The problem is basic

How can you tell whether a number is prime? What if the number has hundreds or thousands of digits? This question may seem abstract or irrelevant, but in fact,

This edition has been called ‘startlingly up-to-date’, and in this corrected second printing you can be sure that it’s even more contemporaneous. It surve