<電子ブック>
A Course in Computational Algebraic Number Theory / by Henri Cohen
(Graduate Texts in Mathematics. ISSN:21975612 ; 138)
版 | 1st ed. 1993. |
---|---|
出版者 | (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer) |
出版年 | 1993 |
本文言語 | 英語 |
大きさ | XXI, 536 p : online resource |
著者標目 | *Cohen, Henri author SpringerLink (Online service) |
件 名 | LCSH:Number theory LCSH:Algebra LCSH:Computer science LCSH:Algorithms LCSH:Computer science -- Mathematics 全ての件名で検索 FREE:Number Theory FREE:Algebra FREE:Theory of Computation FREE:Algorithms FREE:Symbolic and Algebraic Manipulation |
一般注記 | 1. Fundamental Number-Theoretic Algorithms -- 2. Algorithms for Linear Algebra and Lattices -- 3. Algorithms on Polynomials -- 4. Algorithms for Algebraic Number Theory I -- 5. Algorithms for Quadratic Fields -- 6. Algorithms for Algebraic Number Theory II -- 7. Introduction to Elliptic Curves -- 8. Factoring in the Dark Ages -- 9. Modern Primality Tests -- 10. Modern Factoring Methods -- Appendix A. Packages for Number Theory -- Appendix B. Some Useful Tables -- B.1. Table of Class Numbers of Complex Quadratic Fields -- B.2. Table of Class Numbers and Units of Real Quadratic Fields -- B.3. Table of Class Numbers and Units of Complex Cubic Fields -- B.4. Table of Class Numbers and Units of Totally Real Cubic Fields -- B.5. Table of Elliptic Curves With the advent of powerful computing tools and numerous advances in math ematics, computer science and cryptography, algorithmic number theory has become an important subject in its own right. Both external and internal pressures gave a powerful impetus to the development of more powerful al gorithms. These in turn led to a large number of spectacular breakthroughs. To mention but a few, the LLL algorithm which has a wide range of appli cations, including real world applications to integer programming, primality testing and factoring algorithms, sub-exponential class group and regulator algorithms, etc ... Several books exist which treat parts of this subject. (It is essentially impossible for an author to keep up with the rapid pace of progress in all areas of this subject.) Each book emphasizes a different area, corresponding to the author's tastes and interests. The most famous, but unfortunately the oldest, is Knuth's Art of Computer Programming, especially Chapter 4. The present book has two goals. First, to give a reasonably comprehensive introductory course in computational number theory. In particular, although we study some subjects in great detail, others are only mentioned, but with suitable pointers to the literature. Hence, we hope that this book can serve as a first course on the subject. A natural sequel would be to study more specialized subjects in the existing literature HTTP:URL=https://doi.org/10.1007/978-3-662-02945-9 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9783662029459 |
|
電子リソース |
|
EB00234226 |
書誌詳細を非表示
データ種別 | 電子ブック |
---|---|
分 類 | LCC:QA241-247.5 DC23:512.7 |
書誌ID | 4000110541 |
ISBN | 9783662029459 |
類似資料
この資料の利用統計
このページへのアクセス回数:9回
※2017年9月4日以降