Primality Testing and Abelian Varieties Over Finite Fields [electronic resource] /

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.

Saved in:
Bibliographic Details
Main Authors: Adleman, Leonard M. author., Huang, Ming-Deh A. author., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1992
Subjects:Mathematics., Arithmetic and logic units, Computer., Computers., Number theory., Combinatorics., Number Theory., Theory of Computation., Arithmetic and Logic Structures.,
Online Access:http://dx.doi.org/10.1007/BFb0090185
Tags: Add Tag
No Tags, Be the first to tag this record!
id KOHA-OAI-TEST:203868
record_format koha
spelling KOHA-OAI-TEST:2038682018-07-30T23:31:56ZPrimality Testing and Abelian Varieties Over Finite Fields [electronic resource] / Adleman, Leonard M. author. Huang, Ming-Deh A. author. SpringerLink (Online service) textBerlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,1992.engFrom 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.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.Mathematics.Arithmetic and logic units, Computer.Computers.Number theory.Combinatorics.Mathematics.Number Theory.Theory of Computation.Combinatorics.Arithmetic and Logic Structures.Springer eBookshttp://dx.doi.org/10.1007/BFb0090185URN:ISBN:9783540470212
institution COLPOS
collection Koha
country México
countrycode MX
component Bibliográfico
access En linea
En linea
databasecode cat-colpos
tag biblioteca
region America del Norte
libraryname Departamento de documentación y biblioteca de COLPOS
language eng
topic Mathematics.
Arithmetic and logic units, Computer.
Computers.
Number theory.
Combinatorics.
Mathematics.
Number Theory.
Theory of Computation.
Combinatorics.
Arithmetic and Logic Structures.
Mathematics.
Arithmetic and logic units, Computer.
Computers.
Number theory.
Combinatorics.
Mathematics.
Number Theory.
Theory of Computation.
Combinatorics.
Arithmetic and Logic Structures.
spellingShingle Mathematics.
Arithmetic and logic units, Computer.
Computers.
Number theory.
Combinatorics.
Mathematics.
Number Theory.
Theory of Computation.
Combinatorics.
Arithmetic and Logic Structures.
Mathematics.
Arithmetic and logic units, Computer.
Computers.
Number theory.
Combinatorics.
Mathematics.
Number Theory.
Theory of Computation.
Combinatorics.
Arithmetic and Logic Structures.
Adleman, Leonard M. author.
Huang, Ming-Deh A. author.
SpringerLink (Online service)
Primality Testing and Abelian Varieties Over Finite Fields [electronic resource] /
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.
format Texto
topic_facet Mathematics.
Arithmetic and logic units, Computer.
Computers.
Number theory.
Combinatorics.
Mathematics.
Number Theory.
Theory of Computation.
Combinatorics.
Arithmetic and Logic Structures.
author Adleman, Leonard M. author.
Huang, Ming-Deh A. author.
SpringerLink (Online service)
author_facet Adleman, Leonard M. author.
Huang, Ming-Deh A. author.
SpringerLink (Online service)
author_sort Adleman, Leonard M. author.
title Primality Testing and Abelian Varieties Over Finite Fields [electronic resource] /
title_short Primality Testing and Abelian Varieties Over Finite Fields [electronic resource] /
title_full Primality Testing and Abelian Varieties Over Finite Fields [electronic resource] /
title_fullStr Primality Testing and Abelian Varieties Over Finite Fields [electronic resource] /
title_full_unstemmed Primality Testing and Abelian Varieties Over Finite Fields [electronic resource] /
title_sort primality testing and abelian varieties over finite fields [electronic resource] /
publisher Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,
publishDate 1992
url http://dx.doi.org/10.1007/BFb0090185
work_keys_str_mv AT adlemanleonardmauthor primalitytestingandabelianvarietiesoverfinitefieldselectronicresource
AT huangmingdehaauthor primalitytestingandabelianvarietiesoverfinitefieldselectronicresource
AT springerlinkonlineservice primalitytestingandabelianvarietiesoverfinitefieldselectronicresource
_version_ 1756267896874467328