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: 55.99 USD
Availability: OutOfStock
Author: Martin Dietzfelbinger

Precio

$ 55,99

sin IVA

Pedido desde almacén remoto

Entrega prevista 29 de jun. - 10 de jul.

Nuestros clientes opinan:

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

Política de devolución de 14 días conforme a la legislación europea de protección de los consumidores

Mejor valorado en Trustpilot

Añadir a tu lista de deseos de iMusic

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

Medios de comunicación	Libros Paperback Book (Libro con tapa blanda y lomo encolado)
Publicado	29 de junio de 2004
Fecha de lanzamiento original	2003
ISBN13	9783540403449
Editores	Springer-Verlag Berlin and Heidelberg Gm
Páginas	160
Dimensiones	155 × 233 × 8 mm · 249 g
Lengua	Alemán