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

Cena

€ 52,99

Objednané zo vzdialeného skladu

Očakávané doručenie 17. - 25. sep

Dostávajte upozornenia na nové nahrávky interpreta Martin Dietzfelbinger

Naši zákazníci hovoria:

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

14-dňová lehota na vrátenie podľa európskej legislatívy o ochrane spotrebiteľa

Najvyššie hodnotenie na Trustpilot

Pridať do vášho zoznamu prianí na 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

Médium	Knihy Paperback Book (Kniha s mäkkou väzbou a lepeným chrbtom)
Vydané	29. júna 2004
Pôvodný dátum vydania	2003
ISBN13	9783540403449
Vydavatelia	Springer-Verlag Berlin and Heidelberg Gm
Strany	160
Rozmery	155 × 233 × 8 mm · 249 g
Jazyk	Nemčina