| 000 | 01207cam a2200265 i 4500 | ||
|---|---|---|---|
| 999 |
_c12120 _d12120 |
||
| 001 | 787999 | ||
| 005 | 20220725162528.0 | ||
| 008 | 750116s1974 maua b 001 0 eng | ||
| 020 | _a0201000296 | ||
| 020 | _a9788131702055 | ||
| 040 | _cDLC | ||
| 082 | 0 | 0 |
_a005.13 _bA2869 |
| 100 | 1 | _aAho, Alfred V. | |
| 245 | 1 | 4 |
_aThe design and analysis of computer algorithms _c/ Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman. |
| 260 |
_aNew Delhi : _bPearson, _c2009 |
||
| 300 |
_ax, 470 p. : _bill. ; _c24 cm. |
||
| 490 | 0 | _aAddison-Wesley series in computer science and information processing | |
| 500 | _aIncludes index. | ||
| 650 | 0 | _aComputer programming. | |
| 650 | 0 | _aComputer algorithms. | |
| 700 | 1 | _aHopcroft, John E., | |
| 700 | 1 | _aUllman, Jeffrey D., | |
| 942 | _cBK | ||
| 505 | 0 | _a1. 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 multiplication and related operations 7. Integer and polynomial arithmetic 8. Pattern-matching algorithms 9. Np-complete problems 10. Some provably intractable problems 11. Lower bounds on numbers of arithmetic operations | |