Primality Testing and Abelian Varieties Over Finite Fields

Leonard M. Adleman, Ming-Deh A. Huang (Autoren)

Buch | Softcover

VIII, 144 Seiten

1992 | 1992
Springer Berlin (Verlag)
978-3-540-55308-3 (ISBN)

Artikel merken

From Gauss to G|del, mathematicians have sought an efficientalgorithm to distinguish prime numbers from compositenumbers. This book presents a random polynomial timealgorithm for the problem. The methods used are fromarithmetic algebraic geometry, algebraic number theory andanalyticnumber theory. In particular, the theory of twodimensional Abelian varieties over finite fields isdeveloped.The book will be of interest to both researchers andgraduate students in number theory and theoretical computerscience.

Acknowledgement.- Overview of the algorithm and the proof of the main theorem.- Reduction of main theorem to three propositions.- Proof of proposition 1.- Proof of proposition 2.- Proof of proposition 3.

Erscheint lt. Verlag	8.4.1992
Reihe/Serie	Lecture Notes in Mathematics
Zusatzinfo	VIII, 144 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	240 g
Themenwelt	Mathematik / Informatik ► Mathematik ► Arithmetik / Zahlentheorie
Themenwelt	Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
Schlagworte	Abelian varieties • combinatorics • Computational Complexity • finite field • Number Theory • Prime • Prime number • Prime Numbers
ISBN-10	3-540-55308-8 / 3540553088
ISBN-13	978-3-540-55308-3 / 9783540553083
Zustand	Neuware