Primality Testing and Abelian Varieties Over Finite Fields
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 theor...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Livre numérique |
| Dil: | Anglais |
| Baskı/Yayın Bilgisi: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seri Bilgileri: | Lecture notes in mathematics
1512 |
| Konular: | |
| Online Erişim: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Not: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Primality testing and Abelian varieties over finite fields, Leonard M. Adleman, Ming-Deh A. Huang, Berlin, Springer-Verlag, 1992, 1 vol. (VII-142 p.), Lecture notes in mathematics, 0-387-55308-8 • Primality Testing and Abelian Varieties Over Finite Fields, Texte imprimé, 9783662170595 |
İçindekiler:
- 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.