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 ana
โฆ LIBER โฆ
Primality Testing and Abelian Varieties over Finite Fields
โ Scribed by Leonard M. Adleman, Ming-Deh A. Huang
- Book ID
- 127403566
- Publisher
- Springer
- Year
- 1992
- Tongue
- English
- Weight
- 494 KB
- Series
- Lecture Notes in Mathematics
- Edition
- 1
- Category
- Library
- ISBN
- 3540553088
No coin nor oath required. For personal study only.
โฆ Synopsis
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.
๐ SIMILAR VOLUMES
Primary Testing and Abelian Varieties Ov
โ
Leonard M. Adleman, Ming-Deh A. Huang
๐
Library
๐
1992
๐
Springer
๐
English
โ 800 KB
Abelian Varieties Over Finite Fields
โ
Serge Lang
๐
Article
๐
1955
๐
National Academy of Sciences
๐
English
โ 161 KB
Supersingular Abelian Varieties over Fin
โ
Hui June Zhu
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 181 KB
Superspecial abelian varieties over fini
โ
Chia-Fu Yu
๐
Article
๐
2012
๐
Elsevier Science
๐
English
โ 274 KB
Endomorphisms of abelian varieties over
โ
John Tate
๐
Article
๐
1966
๐
Springer-Verlag
๐
English
โ 531 KB
Finite group subschemes of abelian varie
โ
Rybakov, Sergey
๐
Article
๐
2014
๐
Elsevier Science
๐
English
โ 334 KB