Cover Image

Primality testing in polynomial time : from randomized algorithms to "primes" is in P /

Show other versions (1)

Publisher description: 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 wh...

Full description

Bibliographic Details
Main Author: Dietzfelbinger, Martin
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Berlin ; New York : Springer, [2004]
Edition:1st ed.
Series:Lecture notes in computer science. Tutorial.
Lecture notes in computer science ; 3000.
Subjects:
Polynomials.
Numbers, Prime.
Algorithms.
Algorithme.
Coderingstheorie.
Nombre premier.
Polynomen.
Polynôme.
Polynômes.
Nombres premiers.
Algorithmes.
Primzahltest.
Polynomialzeitalgorithmus.
Effizienter Algorithmus.
Electronic books.
Online Access:Connect to the full text of this electronic book
Table of Contents:
  • Introduction : efficient primality testing
  • Algorithms for numbers and their complexity
  • Fundamentals from number theory
  • Basics from algebra : groups, rings, and fields
  • The Miller-Rabin test
  • The Solvay-Strassen test
  • More algebra : polynomials and fields
  • Deterministic primality testing in polynomial time.