Format:
Online-Ressource (X, 147p. Also available online)
,
digital
Edition:
Springer eBook collection. Computer science
ISBN:
9783540259336
,
3540403442
,
9783540403449
Series Statement:
Lecture notes in computer science 3000
Content:
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 digits needed 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
Note:
Literaturverz. S. [143] - 144
Additional Edition:
ISBN 9783540403449
Additional Edition:
Erscheint auch als Druck-Ausgabe Dietzfelbinger, Martin, 1956 - Primality testing in polynomial time Berlin : Springer, 2004 ISBN 3540403442
Language:
English
Subjects:
Computer Science
,
Mathematics
Keywords:
Primzahltest
;
Polynomialzeitalgorithmus
;
Effizienter Algorithmus
;
Primzahltest
;
Deterministischer Prozess
;
Algorithmus
URL:
Volltext
(lizenzpflichtig)
Author information:
Dietzfelbinger, Martin 1956-
