English
A clear and engaging undergraduate textbook on computer science algorithms by Sanjoy Dasgupta , Christos H. Papadimitriou , and Umesh Vazirani . The book presents fundamental algorithmic techniques and topics including divide-and-conquer, graph algorithms, dynamic programming, linear programming, NP-completeness, cryptography, and quantum algorithms, with an emphasis on intuition, mathematical ideas, and clear exposition. Originally developed from lecture notes for undergraduate courses at University of California, Berkeley and University of California, San Diego .
Zaloguj się na bezpłatne konto, aby czytać, pobierać EPUB-y lub słuchać.