Gathen,Joachim von zur <br/><br/>
Modern Computer Algebra 
Joachim von zur Gathen 
 - 3RD 
 - London  Cambridge  2013 
 - 795p 
<br/><br/> Introduction<br/>1. Cyclohexane, cryptography, codes, and computer algebra<br/>Part I. Euclid:<br/>2. Fundamental algorithms<br/>3. The Euclidean Algorithm<br/>4. Applications of the Euclidean Algorithm<br/>5. Modular algorithms and interpolation<br/>6. The resultant and gcd computation<br/>7. Application: decoding BCH codes<br/>Part II. Newton:<br/>8. Fast multiplication<br/>9. Newton iteration<br/>10. Fast polynomial evaluation and interpolation<br/>11. Fast Euclidean Algorithm<br/>12. Fast linear algebra<br/>13. Fourier Transform and image compression<br/>Part III. Gauß:<br/>14. Factoring polynomials over finite fields<br/>15. Hensel lifting and factoring polynomials<br/>16. Short vectors in lattices<br/>17. Applications of basis reduction<br/>Part IV. Fermat:<br/>18. Primality testing<br/>19. Factoring integers<br/>20. Application: public key cryptography<br/>Part V. Hilbert:<br/>21. Gröbner bases<br/>22. Symbolic integration<br/>23. Symbolic summation<br/>24. Applications<br/>Appendix:<br/>25. Fundamental concepts<br/>Sources of illustrations<br/>Sources of quotations<br/>List of algorithms<br/>List of figures and tables<br/>References<br/>List of notation<br/>Index. 
<br/><br/> Computer 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.<br/><br/>Detailed algorithms with analysis, and complete proofs (none left to the reader)<br/>Student-friendly with gentle introductions and overviews<br/>Includes many illustrations and applications and much historical background<br/>Solutions to selected exercises are available from the book's webpage 
<br/><br/><label>ISBN: </label>9781107039032 
<br/><br/><label>Dewey Class. No.: </label>512.002  / GAT