A Guide to Algorithm Design Paradigms, Methods, and Complexity Analysis
Language: English
Published by CRC Press, 2013
Series: Book 3 of 5 - Chapman & Hall/CRC Applied Algorithms and Data Structures series
- Hardcover
- New
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.Romtrade Corp.
AbeBooks seller since April 17, 2013
Condition: New
US$ 107.10
Quantity: 5 available
Add to basketItem description from seller
This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Seller Inventory # ABBB-37216
- Title
- A Guide to Algorithm Design Paradigms, Methods, and Complexity Analysis
- Author
- Benoit, Anne; Robert, Yves; Vivien, Frédéric
- Publisher
- CRC Press
- Publication year
- 2013
- Condition
- New
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 1439825645
- ISBN 13
- 9781439825648
- 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.
Romtrade Corp.
STERLING HEIGHTS, MI, U.S.A.
AbeBooks seller since April 17, 2013
Shipping rates within U.S.A.
| Item | 3 to 6 business days | 5 to 10 business days |
|---|---|---|
| First item | US$ 0.00 | US$ 0.00 |
Payment methods
Store description
We sell textbooks to students at very affordable prices. All books are brand new, satisfaction guaranteed.
Specialty
TextbooksSeller's business information
Romtrade Corp.
39137 BYERS DR.
STERLING HEIGHTS, MI U.S.A. 48310
Terms of sale
We guarantee the condition of every book as it's described on the Abebooks web
sites. If you're dissatisfied with your purchase (Incorrect Book/Not as
Described/Damaged) or if the order hasn't arrived, you're eligible for a refund
within 30 days of the estimated delivery date. If you've changed your mind about
a book that you've ordered, please use the Ask bookseller a question link to
contact us and we'll respond within 2 business days. The contact persons name is
Constantin Marandici and the mail id where you can send a mail is
discount_scientific_books@yahoo.com. We can be also contacted at 586-977-9198.
Our address
39137 Byers Dr.
Sterling Heights, MI - 48310
USA
Shipping terms
Orders usually ship within 2 business days. Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required. We use USPS, DHL and ARAMEX for shipping.