Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P": 3000 (Lecture Notes in Computer Science)
4.5 (1,234)
Sold 100+ last 30 days
20% off first order
$39.00$65.00
40% off
Color
Black
Quantity
Product description loading
Product description loading
This is the product description text that will appear here.
Quantity
1
Description
A self-contained treatment of theoretically and practically important efficient algorithms for the primality problem. The text covers the randomized algorithms by Solovay-Strassen and Miller-Rabin from the late 1970s as well as the recent d...