Martin Dietzfelbinger
Primality Testing in Polynomial Time: from Randomized Algorithms to 'primes is in P' - Lecture Notes in Computer Science Martin Dietzfelbinger

Name: Primality Testing in Polynomial Time: from Randomized Algorithms to 'primes is in P' - Lecture Notes in Computer Science
Price: 529 NOK
Availability: OutOfStock
Author: Martin Dietzfelbinger

Pris

NOK 529

Bestillingsvarer

Forventes levert 5. - 13. aug

Få varsel om nye utgivelser fra Martin Dietzfelbinger

Kundene våre sier:

Top-vurdering på Google Reviews, baseret på tusinder af anmeldelser.

14 dages returrett

Toppvurdering på Trustpilot

Legg til iMusic ønskeliste

eller

Ikke vurdert ennå

Primality Testing in Polynomial Time: from Randomized Algorithms to 'primes is in P' - Lecture Notes in Computer Science

Martin Dietzfelbinger

Written for students of computer science, this volume gives a treatment 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 as well as deterministic algorithm of Agrawal, Kayal, and Saxena.

160 pages, biography

Media	Bøker Pocketbok (Bok med mykt omslag og limt rygg)
Utgitt	29. juni 2004
Opprinelig utgitt	2003
ISBN13	9783540403449
Utgivere	Springer-Verlag Berlin and Heidelberg Gm
Antall sider	160
Mål	155 × 233 × 8 mm · 249 g
Språk	Tysk