2046626
9783540403449
This work gives a self-contained account of theoretically and practically important efficient algorithms for the primality problem, covering the randomized algorithms by Solovay-Strassen and Miller-Rabin from the late 1970s.Dietzfelbinger, M. is the author of 'Primality Testing in Polynomial Time From Randomized Algorithms to "Primes Is in P"', published 2004 under ISBN 9783540403449 and ISBN 3540403442.
[read more]