000			01154cam a2200289 a 4500
999			_c435 _d435
001			1164580
003			OSt
005			20170821192014.0
008			960916s1996 gw a b 001 0 eng
010			_a 96044745
020			_a9783540556404 (hbk): _cEURO 64.95
040			_aDLC _cIISER-BPR _dIISER-BPR _bENG
041			_aENG
050	0	0	_aQA247 _b.C55 1996
082	0	0	_223rd _a512.7 _bCOH/C
100	1		_aCohen, Henri.
245	1	2	_aCourse in computational algebraic number theory / _c[by] Henri Cohen.
250			_a3rd ed.
260			_aBerlin ; _aNew York : _bSpringer, _c1996.
300			_axx, 551 p. : _bill. ; _c24 cm.
440		0	_aGraduate texts in mathematics, _x0072-5285 ; _v138
504			_aIncludes bibliographical references (p. [527]-539) and index.
520			_a Describes 148 algorithms that are fundamental for number-theoretic computations including computations related to algebraic number theory, elliptic curves, primality testing, and factoring. A complete theoretical introduction is given for each subject, reducing prerequisites to a minimum. The detailed description of each algorithm allows immediate.
650		0	_aAlgebraic number theory
650		0	_aData processing.
650		0	_aAlgorithms
650		0	_aComputer software
856	4	2	_3Publisher description _uhttp://www.loc.gov/catdir/enhancements/fy0812/96044745-d.html
906			_a7 _bcbc _corignew _d1 _eocip _f19 _gy-gencatlg
942			_2ddc _cBK