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: 60.49 EUR
Availability: OutOfStock
Author: Martin Dietzfelbinger

Cena

€ 60,49

Naročeno iz oddaljenega skladišča

Predvidena dobava 11. - 25. avg

Prejemajte obvestila o novih izdajah izvajalca Martin Dietzfelbinger

Kaj pravijo naše stranke:

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

14-dnevna politika vračila v skladu z evropsko zakonodajo o varstvu potrošnikov

Najvišja ocena na Trustpilot

Dodaj na svoj seznam želja iMusic

Not rated yet

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

Medij	Knjige Paperback Book (Knjiga z mehkimi platnicami in lepljenim hrbtom)
Izdano	29. junija 2004
Prvotni datum izida	2003
ISBN13	9783540403449
Založniki	Springer-Verlag Berlin and Heidelberg Gm
Strani	160
Dimenzije	155 × 233 × 8 mm · 249 g
Jezik	Nemščina