Overview

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

Full Product Details

Author:   Leonard M. Adleman ,  Ming-Deh A. Huang
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   1992 ed.
Volume:   1512
Dimensions:   Width: 15.50cm , Height: 0.80cm , Length: 23.50cm
Weight:   0.490kg
ISBN:  

9783540553083

ISBN 10:   3540553088
Pages:   144
Publication Date:   08 April 1992
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Out of print, replaced by POD  
We will order this item for you from a manufatured on demand supplier.

Table of Contents

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions