BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis (Chapman & Hall/CRC Applied Algorithms and Data Structures series)

A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis (Chapman & Hall/CRC Applied Algorithms and Data Structures series)

A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis
Stock photo: cover may vary

A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis (Chapman & Hall/CRC Applied Algorithms and Data Structures series) Hardback - 2013

by Benoit, Anne

Add to wish list
  • New
  • Hardback
  • first
New

Description

CRC Press, 2013-08-27. 1. hardcover. New. 6.25x0.75x9.50. Buy with confidence. Excellent Customer Service & Return policy.
Ask the seller a question Add to wish list
A$159.51
Free Delivery within USA
Standard delivery: 5 to 10 days
More delivery options
Dropship order
Ships from Ergodebooks (Texas, United States)

Details

  • Title A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis (Chapman & Hall/CRC Applied Algorithms and Data Structures series)
  • Author Benoit, Anne
  • Binding Hardback
  • Edition 1
  • Condition New
  • Pages 362
  • Language ENG
  • Publisher CRC Press
  • Publication date 2013-08-27
  • Features Bibliography, Illustrated, Index
  • Bookseller's Inventory # DADAX1439825645
  • ISBN 9781439825648
  • Weight 0.09 lbs (0.04 kg)
  • Size 6.25x0.75x9.50
  • Themes
    • Aspects (Academic): Science/Technology Aspects
  • Quantity available 1

About Ergodebooks Texas, United States

Biblio member since 2005

Our goal is to provide best customer service and good condition books for the lowest possible price. We are always honest about condition of book. We list book only by ISBN # and hence exact book is guaranteed.

Terms of Sale:

We have 30 day return policy.

Browse books from Ergodebooks

Reader reviews for A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis (Chapman & Hall/CRC Applied Algorithms and Data Structures series)

From the publisher

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.

About the author

Yves Robert, cole Normale Suprieure de Lyon, Institut Universitaire de France, and Universit de Lyon, France

Anne Benoit and Frederic Vivien, cole Normale Suprieure de Lyon, France

tracking-