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

Cena

€ 53,99

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 14. - 22. jūl.

Mūsu klienti saka:

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

14 dienu atgriešanas politika saskaņā ar Eiropas patērētāju tiesību aizsardzības likumu

Top vieta Trustpilot

Pievienot savam iMusic vēlmju sarakstam

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

Mediji	Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists	2004. gada 29. jūnijs
Oriģinālā izdošanas datums	2003
ISBN13	9783540403449
Izdevēji	Springer-Verlag Berlin and Heidelberg Gm
Lapas	160
Izmēri	155 × 233 × 8 mm · 249 g
Valoda	Vācu