Primality testing and Abelian varieties over finitefields

Primality testing and Abelian varieties over finitefields

by Leonard M. Adleman

Part of Lecture notes in mathematics ;

Join Readfeed freeFind clubs reading this
Rate this book:

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
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.

Discuss Primality testing and Abelian varieties over finitefields with other readers

Join or start a book club for Primality testing and Abelian varieties over finitefields on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for Primality testing and Abelian varieties over finitefields?

Sign up free on Readfeed, then browse public clubs or start your own club with Primality testing and Abelian varieties over finitefields as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Primality testing and Abelian varieties over finitefields with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Primality testing and Abelian varieties over finitefields with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.