장바구니
분야별도서
컴퓨터공학
자료구조/알고리즘
컴퓨터공학
자료구조/알고리즘
분야별도서
Algorithms
- 저자Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani
- 발행일2006-09-15
- 정가33,000원
- 페이지320 페이지
- ISBN0073523402
- 책소개
- 저자소개
- 목차
- 출판사 서평
Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence.
An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center.
"Algorithms is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject. Like a captivating novel, it is a joy to read." Tim Roughgarden Stanford University
Exercises
8 NP-complete problems
8.1 Search problems
8.2 NP-complete problems
8.3 The reductions
Exercises
9 Coping with NP-completeness
9.1 Intelligent exhaustive search
9.2 Approximation algorithms
9.3 Local search heuristics
Exercises
10 Quantum algorithms
10.1 Qubits, superposition, and measurement
10.2 The plan
10.3 The quantum Fourier transform
10.4 Periodicity
10.5 Quantum circuits
10.6 Factoring as periodicity
10.7 The quantum algorithm for factoring
Exercises
Historical notes and further reading
Index
