this is the second to best textbook for algorithm, just under CLRS. It covers all the fundamental techniques as well as NP-complete problems and Quantum algorithms.
S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani July 18, 2006 This book evolved over the past ten years from a set of lecture notes developed while teaching the undergraduate Algorithms course at Berkeley and U.C. San Diego.
给出目录，内容大家自己看吧。540页。 Contents PART I: ALGORITHMS 1 Problem and algorithms 2 Turing machine 3 Gomputability PART II: LOGIC 4 Boolean logic 5 First-order logic 6 Undecidability in logic PART III P AND NP 7 Relations between complexity classes 8 Reducti
