This text presents the main techniques of algorithm design, namely, divide-and-conquer algorithms, greedy algorithms, dynamic programming algorithms, and backtracking. Graph algorithms are studied in detail, and a careful treatment of the theory of NP-completeness is presented.
Techniques for Designing and Analyzing Algorithms
This text presents the main techniques of algorithm design, namely, divide-and-conquer algorithms, greedy algorithms, dynamic programming algorithms, and backtracking. Graph algorithms are studied in detail, and a careful treatment of the theory of NP-completeness is presented.
74.99
In Stock
5
1
Techniques for Designing and Analyzing Algorithms
444Techniques for Designing and Analyzing Algorithms
444
74.99
In Stock
Product Details
ISBN-13: | 9781032024103 |
---|---|
Publisher: | CRC Press |
Publication date: | 08/26/2024 |
Series: | Chapman & Hall/CRC Cryptography and Network Security Series |
Pages: | 444 |
Product dimensions: | 7.00(w) x 10.00(h) x (d) |
About the Author
From the B&N Reads Blog