000 | 01161nam a22002417a 4500 | ||
---|---|---|---|
999 |
_c418 _d418 |
||
003 | OSt | ||
005 | 20180612102824.0 | ||
008 | 160713b xxu||||| |||| 00| 0 eng d | ||
020 | _a9788131702055 | ||
040 | _aDBCETL | ||
041 | _aEng. | ||
082 |
_a001.642 _bAHO |
||
100 | _aAho, Alfred V | ||
245 | _aThe design and analysis of computer algorithms | ||
260 |
_aNew Delhi. : _bPearson, _c2008. |
||
300 |
_ax, 470 p.; _bPAPER BACK _c24 cm. |
||
500 | _aComputer Science | ||
505 | _aCONTENTS: 1. Models of computation 2. Design of efficient algorithms 3. Sorting and order statistics 4. Data structures for set manipulation problems 5. Algorithms on graphs 6. Matrix manipulation and related operations 7. The fast Fourier transform and its applications 8. Integer and polynomial arithmetic 9. Pattern-matching algorithms 10. MP-complete problems 11. Some provably intractable problems 12. Lower bounds on numbers of arithmetic operations Bibliography Index | ||
520 | _a Design, computer algorithms, algorithms. | ||
653 | _aComputer Science, computer algorithms | ||
700 | _a Hopcroft, John E. | ||
700 | _aUllman, Jeffrey D. |