000 | 02205cam a22005057a 4500 | ||
---|---|---|---|
001 | 19109638 | ||
003 | LIBRIS | ||
005 | 20210930195920.0 | ||
008 | 160122s2012 maua 001 0 eng c | ||
010 | _a2011027089 | ||
020 | _a9780273764113 (pbk.) | ||
020 | _a027376411X (pbk.) | ||
020 | _a9780132316811 | ||
020 | _a0132316811 | ||
035 | _a(OCoLC)z9masyb2447609 | ||
040 |
_aDLC _cDLC _dYDX _dYDXCP _dBWX _dHib |
||
082 | 0 | 4 |
_a005.1 _223/swe |
084 |
_aPubb _2kssb/8 (machine generated) |
||
100 | 1 | _aLevitin, Anany. | |
245 | 1 | 0 |
_aIntroduction to the design & analysis of algorithms / _cAnany Levitin; International edition contributions by Soumen Mukherjee, Arup Kumar Bhattacharjee. |
246 | 3 | 0 | _aIntroduction to the design and analysis of algorithms. |
250 | _a3rd ed., International ed. | ||
260 |
_aBoston : _bPearson, _cc2012. |
||
300 |
_a589 p. : _bill. ; _c24 cm. |
||
500 | _a"Authorized adaptation from the United States edition, entitled Introduction to the design and analysis of algorithms, 3rd edition" | ||
504 | _aIncludes bibliographical references and index. | ||
505 | 0 | _aIntroduction -- Fundamentals of the analysis of algorithm efficiency -- Brute force and exhaustive search -- Decreas-and-conquer -- Transform-and-conquer -- Space and time trade-offs -- Dynamic programming -- Greedy technique -- Iterative improvement -- Limitations of algorithm power -- Coping with the limitations of algorithm power. | |
650 | 7 |
_aDatoralgoritmer _2sao _0139124 |
|
650 | 0 | _aComputer algorithms. | |
650 | 7 |
_aDatabehandling _2sao _0142642 |
|
650 | 0 | _aComputer algorithms | |
650 | 0 | _aData processing | |
942 |
_2lcc _cBK |
||
999 |
_c6100 _d6100 |