LEADER 04331nam  22007812  450 
001 9910789314103321
005 20231113181222.0
010   $a9781139856065
010   $a1-316-09077-9
010   $a1-107-24805-1
010   $a1-107-03903-7
010   $a1-139-85606-5
010   $a1-107-25054-4
010   $a1-107-24888-4
010   $a1-107-24971-6
035   $a(CKB)3460000000128927
035   $a(EBL)1357372
035   $a(OCoLC)843762781
035   $a(SSID)ssj0000894076
035   $a(PQKBManifestationID)11523422
035   $a(PQKBTitleCode)TC0000894076
035   $a(PQKBWorkID)10834682
035   $a(PQKB)10508678
035   $a(UkCbUP)CR9781139856065
035   $a(Au-PeEL)EBL1357372
035   $a(CaPaEBR)ebr10740489
035   $a(CaONFJC)MIL508522
035   $a(MiAaPQ)EBC1357372
035   $a(PPN)189894024
035   $a(EXLCZ)993460000000128927
100   $a20121107d2013||||  uy|            0
101 0 $aeng
135   $aur|||||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aModern computer algebra /$fJoachim von zur Gathen, Ju?rgen Gerhard
205   $aThird edition.
210  1$aCambridge :$cCambridge University Press,$d2013.
215   $a1 online resource (xiii, 795 pages) $cdigital, PDF file(s)
300   $aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
311 1 $a9781107039032 
311 1 $a1-299-77271-4 
311 1 $a1-107-24187-1 
320   $aIncludes bibliographical references and index.
327   $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. Gro?bner bases -- 22. Symbolic integration -- 23. Symbolic summation -- 24. Applications -- 25. Fundamental concepts.
330   $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, cryptography, computational logic, and the design of calendars and musical scales). A great deal of historical information and illustration enlivens the text. In this third edition, errors have been corrected and much of the Fast Euclidean Algorithm chapter has been renovated.
606   $aAlgorismes computacionals$2lemac
606   $aĀlgebra$xInformātica$2lemac
606   $aInformātica$xMatemātica$2lemac
606   $aAlgebra$xData processing
606   $aComputer algorithms
606   $aComputer science$xMathematics
615  7$aAlgorismes computacionals
615  7$aĀlgebra$xInformātica
615  7$aInformātica$xMatemātica
615  0$aAlgebra$xData processing.
615  0$aComputer algorithms.
615  0$aComputer science$xMathematics
676   $a512.0028
700   $aGathen$b Joachim von zur$0621883
702   $aGerhard$b Ju?rgen$f1967-,
801  0$bUkCbUP
801  1$bUkCbUP
906   $aBOOK
912   $a9910789314103321
996   $aModern computer algebra$93747647
997   $aUNINA