Pub 2014-08-01 120 Chinese Tsinghua University Press algorithm design and analysis exercises and study guide answers the 21st century undergraduate computer science textbook series consists mainly of divide and conquer strategy. dynamic programming. greedy method . design techniques and analytical methods. such as backtracking and branch and bound algorithms and computational complexity of the problem definition. Based on this brief introduction to the basics of the theory of NP-completeness and approximation algorithms. randomized algorithms. This book can be used as algorithm design and analysis teaching counseling books. Contents Chapter 1 Basics 1.1 Summary 1.2 Exercises 1.3 Exercises Answers and Analysis Chapter 2 Divide and Conquer Strategy 2.1 Summary 2.2 Exercises 2.3 Exercises Answers and analysis of dynamic programming in Chapter 3...
"synopsis" may belong to another edition of this title.
Seller: Goodwill of Silicon Valley, SAN JOSE, CA, U.S.A.
Condition: very_good. Supports Goodwill of Silicon Valley job training programs. The cover and pages are in very good condition! The cover and any other included accessories are also in very good condition showing some minor use. The spine is straight, there are no rips tears or creases on the cover or the pages. Seller Inventory # GWSVV.7302247560.VG
Seller: liu xing, Nanjing, JS, China
paperback. Condition: New. Language:Chinese.Pages Number: 218 Publisher: Tsinghua University. Pub. Date :2011-5-1. The teaching of computer science and technology professional core courses. Algorithm Design and Analysis materials. Book to algorithm design techniques and analysis methods to organize the knowledge of the main line unit The main content includes basic knowledge. divide and conquer. dynamic programming. greedy method. backtracking and branch and bound algorithm analysis and computational complexity of the . Seller Inventory # L86256