Contacto
Como comprar
Entrega
Guia de compras
Primality Testing in Polynomial Time
From Randomized Algorithms to "Primes is in P"
Inglês
111 b
Política de devolução de 30 dias
Os clientes também compraram
/
Capa mole
10.32
€
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 o livro
Inglês
Categorias
Ofereça este livro hoje
É fácil
1 Adicione ao carrinho e escolha Entregar como presente ao finalizar a compra 2 Receberá um vale 3 O livro chegará ao endereço do destinatárioTambém pode estar interessado em
/
Capa mole
44.96
€
/
Capa mole
8.19
€
/
Capa mole
39.29
€
/
Capa mole
10.32
€
Olá! Sou o Libroamiko, o seu conselheiro de livros.
Como posso ajudar?