Limit this search to....

A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis
Contributor(s): Benoit, Anne (Author), Robert, Yves (Author), Vivien, Frédéric (Author)
ISBN: 1439825645     ISBN-13: 9781439825648
Publisher: CRC Press
OUR PRICE:   $104.50  
Product Type: Hardcover - Other Formats
Published: August 2013
Qty:
Temporarily out of stock - Will ship within 2 to 5 weeks
Additional Information
BISAC Categories:
- Computers | Programming - Algorithms
- Mathematics | Arithmetic
- Computers | Programming - Games
Dewey: 005.1
Series: Chapman & Hall/CRC Applied Algorithms and Data Structures
Physical Information: 0.7" H x 6.3" W x 9.4" (1.01 lbs) 380 pages
 
Descriptions, Reviews, Etc.
Publisher Description:

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.