Cargando…
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...
| Autores principales: | , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
Springer
1992
|
| Materias: | |
| Acceso en línea: | https://dx.doi.org/10.1007/BFb0090185 http://cds.cern.ch/record/1691497 |