Primality testing and Abelian varieties over finite fields
Author(s)
Bibliographic Information
Primality testing and Abelian varieties over finite fields
（Lecture notes in mathematics, 1512）
Springer-Verlag, c1992
- : gw
- : us
Available at / 82 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNM||15129206010S
-
Hokkaido University, Library, Graduate School of Science, Faculty of Science and School of Science図書
: Berlindc20:516.3/ad582070224615
-
No Libraries matched.
- Remove all filters.
Note
Bibliography: p. 137-139
Includes index
Description and Table of Contents
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.
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.
by "Nielsen BookData"
