MARC Record from Library of Congress

LEADER: 03052cam a22003737i 4500
001 2013431595
003 DLC
005 20131116081354.0
008 131115s2013 enka b 001 0 eng d
010 $a 2013431595
016 7 $a016416953$2Uk
020 $a9781107039032 (Cloth)
020 $a1107039037 (Cloth)
035 $a(OCoLC)ocn842411159
040 $aCDX$beng$cCDX$erda$dYDXCP$dUAT$dUKMGB$dMUU$dOCLCQ$dMYG$dHEBIS$dDLC
042 $alccopycat
082 04 $a512.0028
050 00 $aQA155.7.E4$bZ87 2013
100 1 $aGathen, Joachim von zur,$eauthor.
245 10 $aModern computer algebra /$cJoachim von zur Gathen, Jürgen Gerhard.
250 $aThird edition.
264 1 $aCambridge :$bCambridge University Press,$c2013.
300 $axiii, 795 pages :$billustrations (some color) ;$c26 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
338 $avolume$bnc$2rdacarrier
500 $aFirst published in 1999.
504 $aIncludes bibliographical references (pages 734-767) and index.
520 3 $aComputer algebra systems are now ubiquitous in all areas of science and engineering. This highly successful textbook, widely regarded as the "bible of computer algebra", gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems. Designed to accompany one- or two- semester courses for advanced undergraduate or graduate students in computer science or mathematics, its comprehensiveness and reliability has also made it an essential reference for professionals in the area. Special features include: detailed study of algorithms including time analysis; implementation reports on several topics; complete proofs of the mathematical underpinnings; and a wide variety of applications (among others, in chemistry, coding theory, crytopgraphy, computational logic, and the design of calendars and musical scales). A great deal of historical information and illustration enlivens the text.
505 0 $a1. 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.
650 0 $aAlgebra$xData processing.
650 0 $aComputer algorithms.
650 0 $aComputer science$xMathematics.
700 1 $aGerhard, Jürgen,$d1967-,$eauthor.