000			03239nam a22003858i 4500
001			CR9781139856065
003			UkCbUP
005			20220711202542.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			121107s2013||||enk o ||1 0|eng|d
020			_a9781139856065 (ebook)
020			_z9781107039032 (hardback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA155.7.E4 _bZ87 2013
082	0	0	_a512.0028 _219
100	1		_aGathen, Joachim von zur, _eauthor. _94532
245	1	0	_aModern computer algebra / _cJoachim von zur Gathen, Jürgen Gerhard.
250			_aThird edition.
264		1	_aCambridge : _bCambridge University Press, _c2013.
300			_a1 online resource (xiii, 795 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
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.
520			_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.
650		0	_aAlgebra _xData processing. _94533
650		0	_aComputer algorithms. _94534
650		0	_aComputer science _xMathematics. _93866
700	1		_aGerhard, Jürgen, _d1967-, _eauthor. _94535
776	0	8	_iPrint version: _z9781107039032
856	4	0	_uhttps://doi.org/10.1017/CBO9781139856065
942			_cEBK
999			_c68282 _d68282