| 000 | 00984nam a2200217 a 4500 | ||
|---|---|---|---|
| 003 | AR-LpUFIB | ||
| 005 | 20250311170133.0 | ||
| 008 | 230201s1996 xxu r 000 0 eng d | ||
| 020 | _a0133350681 | ||
| 024 | 8 |
_aDIF-M202 _b202 _zDIF000208 |
|
| 040 |
_aAR-LpUFIB _bspa _cAR-LpUFIB |
||
| 100 | 1 | _aBrassard, Gilles | |
| 245 | 1 | 0 | _aFundamentals of algorithmics |
| 260 |
_aEnglewood Cliffs : _b[S.n.], _cc1996 |
||
| 300 |
_axiii, 523 p. ; _c23 cm. |
||
| 500 | _aIncluye problemas, referencias y lecturas recomendadas. -- | ||
| 505 | 0 | _a 1- Preliminaries -- 2- Elementary algorithmics 3- Asymptotic notation 4- Analysis of algorithms 5- Some data structures 6- Greedy algorithms 7- Divide-and-conquer 8- Dynamic programming 9- Exploring graphs 10- Probabilistic algorithms 11- Parallel algorithms 12- Computational complexity 13- Heuristic and approximate algorithms -- References (p. 501-515) -- Index. | |
| 650 | 4 | _aANÁLISIS DE ALGORITMOS | |
| 700 | 1 | _aBratley, Paul | |
| 942 | _cBK | ||
| 999 |
_c50209 _d50209 |
||