Office of Academic Resources
Chulalongkorn University
Chulalongkorn University

Home / Help

AuthorAdleman, Leonard M. author
TitlePrimality Testing and Abelian Varieties Over Finite Fields [electronic resource] / by Leonard M. Adleman, Ming-Deh A. Huang
ImprintBerlin, Heidelberg : Springer Berlin Heidelberg, 1992
Connect to
Descript VIII, 144 p. online resource


From Gauss to G el, 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

Mathematics Arithmetic and logic units Computer Computers Number theory Combinatorics Mathematics Number Theory Theory of Computation Combinatorics Arithmetic and Logic Structures


Office of Academic Resources, Chulalongkorn University, Phayathai Rd. Pathumwan Bangkok 10330 Thailand

Contact Us

Tel. 0-2218-2929,
0-2218-2927 (Library Service)
0-2218-2903 (Administrative Division)
Fax. 0-2215-3617, 0-2218-2907

Social Network


facebook   instragram