Edition |
Third edition. |
Description |
1 online resource (815 pages) : illustrations |
Physical Medium |
polychrome |
Description |
text file |
Summary |
Now in its third edition, this highly successful textbook is widely regarded as the 'bible of computer algebra'. |
Bibliography |
Includes bibliographical references and index. |
Contents |
1. Cyclohexane, cryptography, codes, and computer algebra -- 2. Fundamental algorithms -- 3. The Euclidean algorithm -- 4. Applications of the Euclidean algorithm -- 5. Modular algorithms and interpolation -- 6. The resultant and gcd computation -- 7. Application: decoding BCH codes -- 8. Fast multiplication -- 9. Newton iteration -- 10. Fast polynomial evaluation and interpolation -- 11. Fast Euclidean algorithm -- 12. Fast linear algebra -- 13. Fourier transform and image compression -- 14. Factoring polynomials over finite fields -- 15. Hensel lifting and factoring polynomials -- 16. Short vectors in lattices -- 17. Applications of basis reduction -- 18. Primality testing -- 19. Factoring integers -- 20. Application: public key cryptography -- 21. Gröbner bases -- 22. Symbolic integration -- 23. Symbolic summation -- 24. Applications -- 25. Fundamental concepts. |
Local Note |
eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - North America |
Subject |
Computer algorithms.
|
|
Computer algorithms. |
Genre/Form |
Electronic books.
|
Other Form: |
Print version: Gathen, Joachim Von Zur. Modern Computer Algebra. 3rd ed. Cambridge Cambridge University Press, 2013 9781107039032 (OCoLC)842411159 |
ISBN |
9781139856065 (electronic book) |
|
1139856065 (electronic book) |
|
9781299772717 (MyiLibrary) |
|
1299772714 (MyiLibrary) |
|
9781107248052 |
|
1107248051 |
|
9781107250543 (electronic book) |
|
1107250544 (electronic book) |
|
9781107248885 (e-book) |
|
1107248884 (e-book) |
|
9781107039032 |
|
1107039037 |
|