MODERN COMPUTER ALGEBRA

Illustrated Editorial Cardboard. Contents: Introduction Cyclohexane, cryptography, codes, and computer algebra) - Euclid (Fundamental algorithms. The Euclidean Algorithm. Applications of the Euclidean Algorithm. Modular algorithms and interpolation. The resultant and gcd computation. Application: Decoding BCH codes) - Newton (Fast multiplication. Newton iteration. Fast polynomial evaluation and interpolation. Fast Euclidean Algorithm. Fast linear algebra. Transform and image compression) - GauB (Factoring polynomials over finite fields. Hensel lifting and factoring Polynomials. Short vectors in lattices. Applications of basis reduction) - Fermat (Primality testing. Factoring integers. Application: Public key cryptography) - Hilbert (Gróbner bases. Symbolic integration. Symbolic summation. Applications) - Appendix (Fundamental concepts) - End (Sources of illustrations. Sources of quotations. List of algorithms. List of figures and tables. References. List of notation. Index). 754págs