Check nearby libraries
Buy this book

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.
Check nearby libraries
Buy this book

Previews available in: English
Edition | Availability |
---|---|
1
Primality Testing and Abelian Varieties over Finite Fields
2006, Springer London, Limited
in English
3540470212 9783540470212
|
zzzz
|
2
Primary Testing and Abelian Varieties Over Finite Fields (Lecture Notes in Mathematics)
April 1992, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Paperback
in English
3540553088 9783540553083
|
aaaa
|
Book Details
Classifications
The Physical Object
Edition Identifiers
Work Identifiers
Community Reviews (0)
April 7, 2025 | Edited by MARC Bot | import existing book |
July 20, 2024 | Edited by MARC Bot | import existing book |
October 4, 2021 | Edited by ImportBot | import existing book |
August 19, 2021 | Edited by MARC Bot | import existing book |
July 6, 2019 | Created by MARC Bot | import existing book |