000			02150nam a22004335i 4500
001			978-88-470-2397-0
003			DE-He213
005			20140220083335.0
007			cr nn 008mamaa
008			120710s2012 it | s |||| 0|eng d
020			_a9788847023970 _9978-88-470-2397-0
024	7		_a10.1007/978-88-470-2397-0 _2doi
050		4	_aQA150-272
072		7	_aPBF _2bicssc
072		7	_aMAT002000 _2bisacsh
082	0	4	_a512 _223
100	1		_aMachì, Antonio. _eauthor.
245	1	0	_aAlgebra for Symbolic Computation _h[electronic resource] / _cby Antonio Machì.
264		1	_aMilano : _bSpringer Milan : _bImprint: Springer, _c2012.
300			_aVIII, 180 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aUNITEXT, _x2038-5714
505	0		_aThe Euclidean algorithm, the Chinese remainder theorem and interpolation -- p-adic series expansion -- The resultant -- Factorisation of polynomials -- The discrete Fourier transform.
520			_aThis book deals with several topics in algebra useful for computer science applications and the symbolic treatment of algebraic problems, pointing out and discussing their algorithmic nature. The topics covered range from classical results such as the Euclidean algorithm, the Chinese remainder theorem, and polynomial interpolation, to p-adic expansions of rational and algebraic numbers and rational functions, to reach the problem of the polynomial factorisation,  especially via Berlekamp’s method, and the discrete Fourier transform. Basic algebra concepts are revised in a form suited for implementation on a computer algebra system.
650		0	_aMathematics.
650		0	_aAlgebra.
650	1	4	_aMathematics.
650	2	4	_aAlgebra.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9788847023963
830		0	_aUNITEXT, _x2038-5714
856	4	0	_uhttp://dx.doi.org/10.1007/978-88-470-2397-0
912			_aZDB-2-SMA
999			_c104127 _d104127