000			01732cam a2200361 a 4500
001			15938445
003			BD-DhUL
005			20140905083838.0
008			091009s2011 mau b 001 0 eng
010			_a 2009040309
020			_a9780763782504 (casebound)
020			_a0763782505 (casebound)
040			_aDLC _cDLC _dDLC _dBD-DhUL
050	0	0	_aQA9.58 _b.N43 2011
082	0	0	_a518.1 _222 _bNEF
100	1		_aNeapolitan, Richard E.
245	1	0	_aFoundations of algorithms / _cRichard Neapoltian and Kumarss Naimipour.
250			_a4th ed.
260			_aSudbury, Mass. : _bJones and Bartlett Publishers, _cc2011.
300			_axv, 627 p. L _bill. ; _c24 cm.
365			_aUS$ _b120.56
500			_aRev. ed. of: Foundations of algorithms using C++ pseudocode. 3rd ed. c2004.
504			_aIncludes bibliographical references and index.
505	0		_aAlgorithms: efficiency, analysis, and order -- Divide-and-conquer -- Dynamic programming -- The greedy approach -- Backtracking -- Branch-and-bound -- Introduction to computational complexity : the sorting problem -- More computational complexity : the searching problem -- Computational complexity and intractability : an introduction to the theory of NP -- Number-theoretic algorithms -- Introduction to parallel algorithms.
650		0	_aAlgorithms.
650		0	_aConstructive mathematics.
650		0	_aComputational complexity.
700	1		_aNaimipour, Kumarss.
700	1		_aNeapolitan, Richard E. _tFoundations of algorithms using C++ pseudocode.
906			_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg
942			_2ddc _cBK
955			_bxh00 2009-10-09 _ixh07 2009-10-09 to Dewey _axe10 2010-05-05 1 copy rec'd., to CIP ver. _axh00 2010-05-07 to USPL/STM
999			_c8207 _d8207