A course in computational algebraic number theory
The book describes 148 algorithms that are fundamental for number-theoretic computations including computations related to algebraic number theory, elliptic curves, primality testing, and factoring. The detailed description of each algorithm allows immediate computer implementation; numerous further...
שמור ב:
| מחבר ראשי: | |
|---|---|
| פורמט: | ספר |
| שפה: | Undetermined |
| יצא לאור: |
New York
Springer-Verlag
1996
|
| נושאים: | |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|
| LEADER | 01122nam a2200193Ia 4500 | ||
|---|---|---|---|
| 001 | CTU_19206 | ||
| 008 | 210402s9999 xx 000 0 und d | ||
| 082 | |a 512.74 | ||
| 082 | |b C678 | ||
| 100 | |a Henri Cohen | ||
| 245 | 2 | |a A course in computational algebraic number theory | |
| 245 | 0 | |c Henri Cohen | |
| 260 | |a New York | ||
| 260 | |b Springer-Verlag | ||
| 260 | |c 1996 | ||
| 520 | |a The book describes 148 algorithms that are fundamental for number-theoretic computations including computations related to algebraic number theory, elliptic curves, primality testing, and factoring. The detailed description of each algorithm allows immediate computer implementation; numerous further hints for implementation are also provided. The book also gives a survey of factoring and primality testing methods, including a detailed description of the number-field sieve algorithm. It ends with a description of available computer package and some useful tables. It contains a large number of exercises | ||
| 650 | |a algebraic number theory | ||
| 904 | |i Minh, 971015 | ||
| 980 | |a Trung tâm Học liệu Trường Đại học Cần Thơ | ||