| 書目名稱 | Primality Testing and Abelian Varieties Over Finite Fields |
| 編輯 | Leonard M. Adleman,Ming-Deh A. Huang |
| 視頻video | http://file.papertrans.cn/756/755129/755129.mp4 |
| 叢書名稱 | Lecture Notes in Mathematics |
| 圖書封面 |  |
| 描述 | From Gauss to G|del, mathematicians have sought an efficientalgorithm to distinguish prime numbers from compositenumbers. This book presents arandom polynomial timealgorithm for the problem. The methods used arefromarithmetic algebraic geometry, algebraic number theory andanalyticnumber theory. In particular, the theory of twodimensional Abelian varieties over finite fields isdeveloped.The book will be of interest to both researchers andgraduate students in number theory and theoreticalcomputerscience. |
| 出版日期 | Book 1992 |
| 關(guān)鍵詞 | Abelian Varieties; Computational Complexity; Number theory; Prime; Prime Numbers; Prime number; finite fie |
| 版次 | 1 |
| doi | https://doi.org/10.1007/BFb0090185 |
| isbn_softcover | 978-3-540-55308-3 |
| isbn_ebook | 978-3-540-47021-2Series ISSN 0075-8434 Series E-ISSN 1617-9692 |
| issn_series | 0075-8434 |
| copyright | Springer-Verlag Berlin Heidelberg 1992 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-14 02:32
發(fā)表于 2025-3-21 19:57:23
