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...

Descripción completa

Detalles Bibliográficos
Autores principales: Adleman, Leonard M, Huang, Ming-Deh A
Lenguaje:eng
Publicado: Springer 1992
Materias:
Acceso en línea:https://dx.doi.org/10.1007/BFb0090185
http://cds.cern.ch/record/1691497
_version_ 1780935766310912000
author Adleman, Leonard M
Huang, Ming-Deh A
author_facet Adleman, Leonard M
Huang, Ming-Deh A
author_sort Adleman, Leonard M
collection CERN
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.
id cern-1691497
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 1992
publisher Springer
record_format invenio
spelling cern-16914972021-04-21T21:09:27Zdoi:10.1007/BFb0090185http://cds.cern.ch/record/1691497engAdleman, Leonard MHuang, Ming-Deh APrimality testing and Abelian varieties over finite fieldsMathematical Physics and MathematicsFrom 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.Springeroai:cds.cern.ch:16914971992
spellingShingle Mathematical Physics and Mathematics
Adleman, Leonard M
Huang, Ming-Deh A
Primality testing and Abelian varieties over finite fields
title Primality testing and Abelian varieties over finite fields
title_full Primality testing and Abelian varieties over finite fields
title_fullStr Primality testing and Abelian varieties over finite fields
title_full_unstemmed Primality testing and Abelian varieties over finite fields
title_short Primality testing and Abelian varieties over finite fields
title_sort primality testing and abelian varieties over finite fields
topic Mathematical Physics and Mathematics
url https://dx.doi.org/10.1007/BFb0090185
http://cds.cern.ch/record/1691497
work_keys_str_mv AT adlemanleonardm primalitytestingandabelianvarietiesoverfinitefields
AT huangmingdeha primalitytestingandabelianvarietiesoverfinitefields