| 000 | 01288nam a2200289 a 4500 | ||
|---|---|---|---|
| 999 |
_c16786 _d16786 |
||
| 001 | BD-DhNSU-16786 | ||
| 003 | BD-DhNSU | ||
| 005 | 20210719144048.0 | ||
| 008 | 190403s2006 maua|||g |||| 001 0|eng d | ||
| 020 | _a0321372913 | ||
| 040 |
_aDLC _cDLC _dBD-DhNSU |
||
| 041 | _aeng | ||
| 050 | 0 | 0 |
_aQA76.9 _b.A43K54 2006 |
| 082 | 0 | 0 |
_a005.1 _bK64a |
| 100 | 1 |
_aKleinberg, Jon, _94922 |
|
| 245 | 0 | 0 |
_aAlgorithm design / _cJon Kleinberg and Éva Tardos. |
| 260 |
_aBoston : _bPearson, _cc2006. |
||
| 300 |
_axxiii, 838 p. : _bill. ; _c24 cm. |
||
| 504 | _aIncludes bibliographical references (p. [805]-814) and index | ||
| 505 | _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 | 0 | _aMathematics, Physics and Statistics | |
| 590 | _aSumaiya Kainat Bintey Kohinoor | ||
| 650 | 0 |
_aComputer algorithms _918967 |
|
| 650 | 4 |
_aData structures (Computer science) _918968 |
|
| 700 | 1 |
_aTardos, Éva, _eauthor _94925 |
|
| 942 |
_2lcc _cBK |
||