Inicio > > Ciencias de la computación > Primality Testing in Polynomial Time
Primality Testing in Polynomial Time

Primality Testing in Polynomial Time

Martin Dietzfelbinger

68,21 €
IVA incluido
Disponible
Editorial:
Springer Nature B.V.
Año de edición:
2004
Materia
Ciencias de la computación
ISBN:
9783540403449
68,21 €
IVA incluido
Disponible

Selecciona una librería:

  • Librería Samer Atenea
  • Librería Aciertas (Toledo)
  • Kálamo Books
  • Librería Perelló (Valencia)
  • Librería Elías (Asturias)
  • Donde los libros
  • Librería Kolima (Madrid)
  • Librería Proteo (Málaga)

A self-contained treatment of theoretically and practically important efficient algorithms for the primality problem. The text covers 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 volume is written for students of computer science, in particular 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.

Artículos relacionados