{"product_id":"primality-testing-in-polynomial-time-from-randomized-algorithms-to-primes-is-in-p-3000-lecture-notes-in-computer-science","title":"Primality Testing in Polynomial Time: From Randomized Algorithms to \"PRIMES Is in P\": 3000 (Lecture Notes in Computer Science)","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 deterministic algorithm of Agrawal, Kayal and Saxena. The volume is written for students of computer science, in particular those with a special interest in cryptology, and students of mathematics, and it may be used as a supplement for courses or for self-study.","brand":"Springer-Verlag Berlin and Heidelberg GmbH \u0026 Co. KG","offers":[{"title":"Default Title","offer_id":39656672493653,"sku":"9783540403449N","price":39.0,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/2481\/5790\/products\/ca3c7883-4ef7-48ef-9c39-b8492e2a2198.jpg?v=1644260195","url":"https:\/\/smeikalbooks.co.uk\/en-us\/products\/primality-testing-in-polynomial-time-from-randomized-algorithms-to-primes-is-in-p-3000-lecture-notes-in-computer-science","provider":"smeikalbooks","version":"1.0","type":"link"}