000			03318nam a22003975i 4500
001			u374850
003			SIRSI
005			20160812084255.0
007			cr nn 008mamaa
008			101013s2011 gw | s |||| 0|eng d
020			_a9783642147647 _9978-3-642-14764-7
040			_cMX-MeUAM
050		4	_aQA76.9.A43
082	0	4	_a005.1 _223
100	1		_aArndt, Jörg. _eauthor.
245	1	0	_aMatters Computational _h[recurso electrónico] : _bIdeas, Algorithms, Source Code / _cby Jörg Arndt.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2011.
300			_aXIV, 978p. 475 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
505	0		_aLow level algorithms -- Bit wizardry -- Permutations and their operations -- Sorting and searching -- Data structures -- Combinatorial generation -- Conventions and considerations -- Combinations -- Compositions -- Subsets -- Mixed radix numbers -- Permutations -- Multisets -- Gray codes for string with restrictions -- Parenthesis strings -- Integer partitions -- Set partitions -- Necklaces and Lyndon words -- Hadamard and conference matrices -- Searching paths in directed graphs -- Fast transforms -- The Fourier transform -- Convolution, correlation, and more FFT algorithms -- The Walsh transform and its relatives -- The Haar transform -- The Hartley transform -- Number theoretic transforms (NTTs) -- Fast wavelet transforms -- Fast arithmetic -- Fast multiplication and exponentiation -- Root extraction -- Iterations for the inversion of a function -- The AGM, elliptic integrals, and algorithms for computing -- Logarithm and exponential function -- Computing the elementary functions with limited resources -- Numerical evaluation of power series -- Cyclotomic polynomials, product forms, and continued fractions -- Synthetic Iterations.-. Algorithms for finite fields -- Modular arithmetic and some number theory -- Binary polynomials -- Shift registers -- Binary finite fields -- The electronic version of the book -- Machine used for benchmarking -- The GP language -- Bibliography -- Index.
520			_aThis book provides algorithms and ideas for computationalists. Subjects treated include low-level algorithms, bit wizardry, combinatorial generation, fast transforms like the Fourier transform, and fast arithmetic for both real numbers and finite fields. Various optimization techniques are described and the actual performance of many given implementations is examined. The focus is on material that does not usually appear in textbooks on algorithms. The implementations are done in C++ and the GP language, written for POSIX-compliant platforms such as the Linux and BSD operating systems.
650		0	_aComputer science.
650		0	_aComputer software.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642147630
856	4	0	_zLibro electrónico _uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-14764-7
596			_a19
942			_cLIBRO_ELEC
999			_c202730 _d202730