Primality Testing and Abelian Varieties Over Finite Fields

Primality Testing and Abelian Varieties Over Finite Fields

By (author)  , By (author) 

Free delivery worldwide

Available. Dispatched from the UK in 6 business days


When will my order arrive?

Available. Expected delivery to the United States in 11-14 business days.


Not ordering to /external/GR/5204483? 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

Product details

  • Paperback | 144 pages
  • 155 x 235 x 8.38mm | 490g
  • Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Berlin, Germany
  • English
  • 1992 ed.
  • VIII, 144 p.
  • 3540553088
  • 9783540553083

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