Primality Testing and Abelian Varieties Over Finite Fields
Free delivery worldwide
Available. Expected delivery to the United States in 9-14 business days.
Not ordering to the United States? Click here.
Description
From Gauss to G|del, mathematicians have sought an efficient
algorithm to distinguish prime numbers from composite
numbers. This book presents a random polynomial time
algorithm for the problem. The methods used are from
arithmetic algebraic geometry, algebraic number theory and
analyticnumber theory. In particular, the theory of two
dimensional Abelian varieties over finite fields is
developed.
The book will be of interest to both researchers and
graduate students in number theory and theoretical computer
science.
show more
algorithm to distinguish prime numbers from composite
numbers. This book presents a random polynomial time
algorithm for the problem. The methods used are from
arithmetic algebraic geometry, algebraic number theory and
analyticnumber theory. In particular, the theory of two
dimensional Abelian varieties over finite fields is
developed.
The book will be of interest to both researchers and
graduate students in number theory and theoretical computer
science.
show more
Product details
- Paperback | 144 pages
- 155 x 235 x 8.38mm | 490g
- 08 Apr 1992
- Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- Springer-Verlag Berlin and Heidelberg GmbH & Co. K
- Berlin, Germany
- English
- 1992 ed.
- VIII, 144 p.
- 3540553088
- 9783540553083
Other books in this series
Standard Integral Table Algebras Generated by a Non-real Element of Small Degree
01 Feb 2002
Paperback
US$50.63
Convex Functions, Monotone Operators and Differentiability
10 Sep 1993
Paperback
US$35.48 US$39.99
Save US$4.51
Table of contents
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.
show more
show more
