000			02035cam a2200289 a 4500
008			120628s2011 mau b 001 0 eng
010			_a2009040309
020			_a9780763782504
035			_a(Sirsi) u8308
040			_aEG-CaNU _c EG-CaNU _d EG-CaNU
042			_ancode
082	0	0	_a518.1 _2 22
100	1		_aNeapolitan, Richard E. _93676
245	1	0	_aFoundations of algorithms / _c Richard Neapoltian and Kumarss Naimipour.
250			_a4th ed.
260			_aSudbury, Mass. : _b Jones and Bartlett Publishers, _c c2011.
300			_axv, 627 p. L _b ill. ; _c 24 cm.
504			_a Includes bibliographical references (p. [609]-613) 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.
520			_aFoundations of Algorithms, Fourth Edition offers a well-balanced presentation of algorithm design, complexity analysis of algorithms, and computational complexity. The volume is accessible to mainstream computer science students who have a background in college algebra and discrete structures. To support their approach, the authors present mathematical concepts using standard English and a simpler notation than is found in most texts. A review of essential mathematical concepts is presented in three appendices. The authors also reinforce the explanations with numerous concrete examples to help students grasp theoretical concepts.
650		0	_aAlgorithms. _915282
650		0	_aConstructive mathematics. _93678
650		0	_aComputational complexity. _9993
700	1		_aNaimipour, Kumarss. _93679
700	1		_aNeapolitan, Richard E. _t Foundations of algorithms using C++ pseudocode. _93676
596			_a1
999			_c7208 _d7208