Book (31 Dec 1993)
Not available for sale
Out of stock
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
| ISBN: | 9780387556406 |
| Publisher: | Springer-Verlag |
| Imprint: | Springer-Verlag |
| Pub date: | 31 Dec 1993 |
| DEWEY: | 512.74028551 |
| DEWEY edition: | 20 |
| Number of pages: | 534 |
| Weight: | 943g |
| Height: | 237mm |
| Width: | 161mm |
| Spine width: | 36mm |
$5.60off
Introduction to Complex Analysis
Paperback
Published 28 Aug 2003
Save $5.60
$1.30off
Summing It Up
Paperback
Published 26 Jan 2018
Save $1.30
Handbook of Mellin Transforms
Paperback
Published 14 Oct 2024
$4.97off
Lectures on Nx(p)
Paperback
Published 14 Oct 2024
Save $4.97
$38.64off
Analytic Number Theory
Paperback
Published 30 Aug 2024
Save $38.64
College Geometry
Paperback
Published 14 Oct 2024
$6.97off
Algebraic Groups and Number The...
Hardback
Published 07 Sep 2023
Save $6.97
$8.99off
Polyadic Transcendental Number ...
Hardback
Published 07 Sep 2024
Save $8.99
$3.16off
Summing It Up
Hardback
Published 14 Jun 2016
Save $3.16
$2.59off
Prime-Detecting Sieves
Hardback
Published 24 Aug 2007
Save $2.59