Primality Testing and Abelian Varieties Over Finite Fields (1992) (Lecture Notes in Mathematics #1512)
By: and
Sign Up Now!
Already a Member? Log In
You must be logged into UK education collection to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- 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.
- Copyright:
- 1992
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9783540470212
- Related ISBNs:
- 9783540553083
- Publisher:
- Springer Berlin Heidelberg
- Date of Addition:
- 08/14/22
- Copyrighted By:
- N/A
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Computers and Internet, Mathematics and Statistics
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.
Reviews
Other Books
- by Leonard M. Adleman
- by Ming-Deh A. Huang
- in Nonfiction
- in Computers and Internet
- in Mathematics and Statistics