M. Dietzfelbinger tous les livres
Primality Testing in Polynomial Time From Randomized Algorithms to
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 in number theory, efficient algorithms that solve it, i.e., algorithms that run in a number ...
(paru le 09/07/2004, consulté 3900 fois)