Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Primality Testing and Abelian Varieties Over Finite Fields

Primality Testing and Abelian Varieties Over Finite Fields

Huang, Ming-Deh A.
Adleman, Leonard M.

Paperback

Series: Lecture Notes in Mathematics, Book 1512

General ComputersGeneral Mathematics

ISBN10: 3540553088
ISBN13: 9783540553083
Publisher: Springer Nature
Published: Apr 8 1992
Pages: 144
Weight: 0.49
Height: 0.33 Width: 6.14 Depth: 9.21
Language: English
From Gauss to Gdel, 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.

Also in

General Mathematics

View All