Techniques for Designing and Analyzing Algorithms
Stinson Douglas R. (University of Waterloo Ontario Canada)
9781032024103
onload="displayBookAvailableStatusC()"/>
Rating:
Rs. 48442.00
Delivery in 25 - 45 working days
Covid-19 Notice
Due to the current situation the Delivey will be delayed than the standard shipping period (21 working days)
Call our hotline 011 7 463 463
Additional Information
Add to wishlist
| Author(s) :- Stinson Douglas R. (University of Waterloo Ontario Canada) | Format :- Paperback |
| Publisher :- Taylor & Francis Ltd | Pub. Date :- 2024-08-26 |
| ISBN-13 :- 9781032024103 | |
| Series:- Chapman & Hall/CRC Cryptography and Network Security Series | |
| Pagination :- 430 pages, 12 Tables, black and white; 66 Line drawings, color; 66 Illustrations, color | |
| Dimensions :- 177 x 255 x 23 | |
| Weight :- 914 |
Description
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.
