Contacto
Cómo comprar
Entrega
Guía de compras
Primality Testing in Polynomial Time
From Randomized Algorithms to "Primes is in P"
Inglés
139 b
Hasta 30 días para devoluciones
Clientes que también han comprado
/
Tapa blanda
12.59
€
This book is devoted to algorithms for the venerable primality problem: Given a natural number n, decide whether it is prime or composite.The problem is basic in number theory, efficient algorithms that solve it, i.e., algorithms that run in a number of computational steps which is polynomial in the number of digitsneeded to write n, are important for theoretical computer science and for applications in algorithmics and cryptology.This book gives a self-contained account 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 the recent deterministic algorithm of Agrawal, Kayal, and Saxena. The textbook is written for students of computer science, in particular for those with a special interest in cryptology, and students of mathematics, and it may be used as a supplement for courses or for self-study.
Sobre el libro
Inglés
Categorías
Regale este libro hoy
Es fácil
1 Añadir al carrito y elegir Entregar como regalo en el checkout 2 Le enviaremos un vale 3 El libro llegará a la dirección del destinatarioTambién puede interesarle
/
Tapa blanda
55.49
€
/
Tapa blanda
58.99
€
/
Tapa blanda
10.09
€
/
Tapa blanda
48.29
€
/
Tapa blanda
13.29
€
¡Hola! Soy Libroamiko, tu asesor de libros.
¿Cómo puedo ayudarte?