| 000 | 01280nam a2200265 a 4500 | ||
|---|---|---|---|
| 001 | 000014156 | ||
| 005 | 20160221095413.0 | ||
| 008 | 110610s2006 xxudk grfn 001 0 eng d | ||
| 942 | _c | ||
| 020 |
_a0321295358 _c(pasta dura) |
||
| 040 |
_aCO-BrUAC _beng _cCO-BrUAC _dCO-BrUAC |
||
| 041 | 0 | _aeng | |
| 082 | 0 | 0 |
_a005.1 _bK64 _222 ed. |
| 100 | 1 | _aKleinberg, Jon. | |
| 245 | 1 | 0 |
_aAlgorithm design / _cJon Kleinberg, Éva Tardos. |
| 260 |
_aBoston : _bPearson ; _bAddison-Wesley, _c2006. |
||
| 300 |
_a838 p. : _bil. grafs., ejemps., etc ;. |
||
| 504 | _aIncluye referencias bibliográficas, índice , etc. | ||
| 505 | 0 |
_gCap. _g1. _tIntroduction: Some representative problems -- _g2. _tBasics of algorithms analysis -- _g3. _tGraphs -- _g4. _tGreedy algorithms -- _g5. _tDivide and conquer -- _g6. _tDynamic programming -- _g7. _tNetwork flow -- _g8. _tNP and computational intractability -- _g9. _tPSPACE: A class of problems beyond NP -- _g10. _tExtending the limits of tractability -- _g11. _tApproximation algorithms -- _g12. _tLocal search -- _g13. _tRandomized algorithms -- _tEpilogue -- _tReference -- _tIndix. |
|
| 650 | 1 | 0 | _aComputer Algorithms |
| 650 | 1 | 4 | _aAlgoritmos |
| 650 | 1 | 0 | _aData Structures (Computer Science) |
| 650 | 1 | 4 | _aEstructura de Datos (Computadores) |
| 700 | 1 | _aTardos, Éva. | |
| 999 |
_c14043 _d14043 |
||