| 000 | 00913nam a2200241 a 4500 | ||
|---|---|---|---|
| 003 | AR-LpUFIB | ||
| 005 | 20250311170537.0 | ||
| 008 | 230201s2008 xxua r 000 0 eng d | ||
| 020 | _a9780073523408 | ||
| 024 | 8 |
_aDIF-M3029 _b3133 _zDIF008325 |
|
| 040 |
_aAR-LpUFIB _bspa _cAR-LpUFIB |
||
| 100 | 1 | _aDasgupta, Sanjoy | |
| 245 | 1 | 0 | _aAlgorithms |
| 260 |
_aBoston : _b[S.n.], _cc2008 |
||
| 300 |
_ax, 320 p. : il. ; _c24 cm. |
||
| 505 | 0 | _a 0 Prologue -- 1 Algorithms with Numbers -- 2 Divide-and-conquer algorithms -- 3 Decompositions of graphs -- 4 Paths in graphs -- 5 Greedy algorithms -- 6 Dynamic Programming -- 7 Linear Programming and Reductions -- 8 NP-complete Problems -- 9 Coping with NP-completeness -- 10 Quantum Algorithms | |
| 650 | 4 | _aALGORITMOS NUMÉRICOS | |
| 650 | 4 | _aALGORITMOS | |
| 650 | 4 | _aGRAFOS | |
| 700 | 1 | _aPapadimitriou, Christos H. | |
| 700 | 1 | _aVazirani, Umesh | |
| 942 | _cBK | ||
| 999 |
_c58094 _d58094 |
||