A Guide To Algorithm Design: Paradigms, Methods, and Complexity Analysis
Language: English
Published by CRC Press, 2014
Series: Book 3 of 5 - Chapman & Hall/CRC Applied Algorithms and Data Structures series
- Hardcover
- Used
Seller: UK BOOKS STORE, London, London, United KingdomUK BOOKS STORE
AbeBooks seller since March 11, 2024
Condition: Used
US$ 201.42
Quantity: Over 20 available
Add to basketItem description from seller
Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 6-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
Seller Inventory # Atlan 9781439825648
- Title
- A Guide To Algorithm Design: Paradigms, Methods, and Complexity Analysis
- Author
- Anne Benoit/Frederic Vivien
- Publisher
- CRC Press
- Publication year
- 2014
- Condition
- New Books
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 1439825645
- ISBN 13
- 9781439825648
- Edition
- International Edition
- Series
- Book 3 of 5: Chapman & Hall/CRC Applied Algorithms and Data Structures series
Presenting a complementary perspective to standard books on algorithms, A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis provides a roadmap for readers to determine the difficulty of an algorithmic problem by finding an optimal solution or proving complexity results. It gives a practical treatment of algorithmic complexity and guides readers in solving algorithmic problems.
Divided into three parts, the book offers a comprehensive set of problems with solutions as well as in-depth case studies that demonstrate how to assess the complexity of a new problem.
- Part I helps readers understand the main design principles and design efficient algorithms.
- Part II covers polynomial reductions from NP-complete problems and approaches that go beyond NP-completeness.
- Part III supplies readers with tools and techniques to evaluate problem complexity, including how to determine which instances are polynomial and which are NP-hard.
Drawing on the authors’ classroom-tested material, this text takes readers step by step through the concepts and methods for analyzing algorithmic complexity. Through many problems and detailed examples, readers can investigate polynomial-time algorithms and NP-completeness and beyond.
"Synopsis" may belong to another edition of this title.
About the Author
Yves Robert, École Normale Supérieure de Lyon, Institut Universitaire de France, and Université de Lyon, France
Anne Benoit and Frederic Vivien, École Normale Supérieure de Lyon, France
"About the title" may belong to another edition of this title.
UK BOOKS STORE
London, London, United Kingdom
AbeBooks seller since March 11, 2024
Shipping rates from United Kingdom to U.S.A.
| Item | 5 to 10 business days | 4 to 7 business days |
|---|---|---|
| First item | US$ 0.00 | US$ 6.76 |
Payment methods
Seller's business information
URBAN BOOK LIMITED
71-75 Shelton Street, Covent Garden
London, United Kingdom WC2H 9JQ