/https://covers.openlibrary.org/b/id/1018914-L.jpg)
A course in computational algebraic number theory
por
Describes 148 algorithms that are fundamental for number-theoretic computations including computations related to algebraic number theory, elliptic curves, primality testing, and factoring. A complete theoretical introduction is given for each subject, reducing prerequisites to a minimum. The detailed description of …
- ● 70% match for you
the long version
Describes 148 algorithms that are fundamental for number-theoretic computations including computations related to algebraic number theory, elliptic curves, primality testing, and factoring. A complete theoretical introduction is given for each subject, reducing prerequisites to a minimum. The detailed description of each algorithm allows immediate.
Margaret's verdict
"Describes 148 algorithms that are fundamental for number-theoretic computations including computations related to algebraic number theory, elliptic curves, primality testing, and factoring. A complete theoretical introduction is given for each …"
highlights
what readers held onto
No highlights yet. Be the first.
discussion
what readers said
No reviews yet. Finish it; tell us what you found.