| 000 | 01708cam a22003374a 4500 | ||
|---|---|---|---|
| 001 | 13832914 | ||
| 003 | OSt | ||
| 005 | 20050523120125.0 | ||
| 008 | 050106s2006 maua b 001 0 eng | ||
| 010 | _a 2005000401 | ||
| 020 | _a0321295358 (alk. paper) | ||
| 020 | _a9788131703106 | ||
| 040 |
_aDLC _cDLC _dDLC |
||
| 042 | _apcc | ||
| 050 | 0 | 0 |
_aQA 76.9 _b.K54 2006 |
| 082 | 0 | 0 |
_a005.1 _222 |
| 100 | 1 |
_aKleinberg, Jon. _95754 |
|
| 245 | 1 | 0 |
_aAlgorithm design / _cJon Kleinberg, Éva Tardos. |
| 260 |
_aBoston : _bPearson/Addison-Wesley, _cc2006. |
||
| 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. | |
| 650 | 0 |
_aComputer algorithms. _95755 |
|
| 650 | 0 |
_aData structures (Computer science) _95580 |
|
| 700 | 1 |
_aTardos, Éva. _95756 |
|
| 856 | 4 | 1 |
_3Table of contents _uhttp://www.loc.gov/catdir/toc/ecip056/2005000401.html |
| 906 |
_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg |
||
| 942 |
_2ddc _cBOOK |
||
| 999 |
_c4893 _d4893 |
||
| 952 |
_w2011-01-20 _p2009-1406 _r2012-12-11 _40 _00 _bMAIN _m1 _10 _oQA 76.9 .K54 2006 _d2009-03-09 _70 _cOpen Collection _2lcc _yBOOK _s2012-11-05 _l1 _aMAIN |
||