![Primality Testing and Abelian Varieties Over Finite Fields [electronic resource] /](/search/themes/bootstrap3/images/libros.png)
Primality Testing and Abelian Varieties Over Finite Fields [electronic resource] /
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.
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Texto biblioteca |
| Language: | eng |
| Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,
1992
|
| Subjects: | Mathematics., Arithmetic and logic units, Computer., Computers., Number theory., Combinatorics., Number Theory., Theory of Computation., Arithmetic and Logic Structures., |
| Online Access: | http://dx.doi.org/10.1007/BFb0090185 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!