000			01623cam a22003374a 4500
005			20250930122157.0
008			060920s2006 maua bi 001 0 eng
010			_a2005-000401
020			_a0321295358 (alk. paper) _cRM333.00
039		9	_a201408060848 _blatihan _c201309201624 _dfati _c200803051130 _dlan _c200802210923 _drahah _y09-20-2006 _zrahah
090			_aQA76.9.A43K554
090			_aQA76.9.A43 _bK554
100	1		_aKleinberg, Jon.
245	1	0	_aAlgorithm design / _cJon Kleinberg, Eva Tardos.
260			_aBoston : _bPearson/Addison-Wesley, _c2006.
300			_axxiii, 838 p. : _bill. ; _c24 cm.
504			_aIncludes bibliographical references (p. [805]-814) and index.
505	0		_aIntroduction: Some representative problems -- Basics of algorithms analysis -- Graphs -- Greedy algorithms -- Divide and conquer -- Dynamic programming -- Network flow -- NP and computational intractability -- PSPACE: A class of problems beyond NP -- Extending the limits of tractability -- Approximation algorithms -- Local search -- Randomized algorithms -- Epilogue: algorithms that run forever.
526			_aBuku bacaan asas fakulti.
650		0	_aComputer algorithms.
650		0	_aData structures (Computer science).
700	1		_aTardy, M. Eugene, _d1934- _954724
856	4	1	_3Table of contents _uhttp://www.loc.gov/catdir/toc/ecip056/2005000401.html
907			_a.b13804868 _b2021-05-28 _c2019-11-12
942			_c01 _n0 _kQA76.9.A43K554
914			_avtls003335331
990			_arab
991			_aJabatan Komputer Industri
998			_at _b2006-07-09 _cm _da _feng _gmau _y0 _z.b13804868
999			_c378442 _d378442