000 | 00923nam a22002297a 4500 | ||
---|---|---|---|
005 | 20241205162508.0 | ||
008 | 241205b |||||||| |||| 00| 0 eng d | ||
020 | _a9780262046305 | ||
040 | _cNational Institute of Technology Goa | ||
082 |
_a005.13 _bCOR//INT |
||
100 | _aCormen, Thomas H | ||
110 | _aLeiserson, Charles E | ||
111 | _aRivest, Ronald L | ||
245 | _aIntroduction to algorithms | ||
250 | _a4th | ||
260 |
_aCambridge: _b The MIT Press, _c 2022 |
||
300 |
_bxx, 1291p.: _c 16x20x3 _e Hardcover |
||
520 | _aA comprehensive update of the leading algorithms text, with new material on matching in bipartite graphs, online algorithms, machine learning, and other topics. | ||
650 |
_2Computer Science Engineering _aComputer Science Engineering; Algorithms; Graph algorithms; Bipartite Graphs; B-Trees; NP-comleteness; Machine-learning |
||
700 | _aClifford, Stein | ||
942 |
_2ddc _cBK _n0 |
||
999 |
_c5140 _d5140 |