Primality testing and Abelian varieties over finite fields
著者
書誌事項
Primality testing and Abelian varieties over finite fields
（Lecture notes in mathematics, 1512）
Springer-Verlag, c1992
- : gw
- : us
大学図書館所蔵 全81件
注記
Bibliography: p. 137-139
Includes index
内容説明・目次
内容説明
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.
目次
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.
「Nielsen BookData」 より