{
"item_title" : "Algorithms and Complexity",
"item_author" : [" Herbert S. Wilf "],
"item_description" : "This book is an introductory textbook on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for algorithm analysis. Recursive algorithms are illustrated by Quicksort, FFT, fast matrix multiplications, and others. Algorithms associated with the network flow problem are fundamental in many areas of graph connectivity, matching theory, etc. Algorithms in number theory are discussed with some applications to public key encryption. This second edition will differ from the present edition mainly in that solutions to most of the exercises will be included.",
"item_img_path" : "https://covers3.booksamillion.com/covers/bam/0/36/765/948/0367659484_b.jpg",
"price_data" : {
"retail_price" : "63.99", "online_price" : "63.99", "our_price" : "63.99", "club_price" : "63.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Algorithms and Complexity
Other Available Formats
Overview
This book is an introductory textbook on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for algorithm analysis. Recursive algorithms are illustrated by Quicksort, FFT, fast matrix multiplications, and others. Algorithms associated with the network flow problem are fundamental in many areas of graph connectivity, matching theory, etc. Algorithms in number theory are discussed with some applications to public key encryption. This second edition will differ from the present edition mainly in that solutions to most of the exercises will be included.
This item is Non-Returnable
Customers Also Bought
- 1
Details
- ISBN-13: 9780367659486
- ISBN-10: 0367659484
- Publisher: A K PETERS
- Publish Date: September 2020
- Page Count: 219
Related Categories
You May Also Like...
- 1
