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.
Read More
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.
Read Less
Add this copy of Techniques for Designing and Analyzing Algorithms to cart. $75.13, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2024 by CRC Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Trade paperback (US). Glued binding. 430 p. Contains: Unspecified, Illustrations, color, Line drawings, color, Tables, black & white. Chapman & Hall/CRC Cryptography and Network Security. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Techniques for Designing and Analyzing Algorithms to cart. $75.14, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2024 by CRC Press.
Add this copy of Techniques for Designing and Analyzing Algorithms to cart. $92.30, new condition, Sold by Paperbackshop rated 5.0 out of 5 stars, ships from Bensenville, IL, UNITED STATES, published 2024 by CRC Press.
