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

Synopsis

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.

Copyright:

2014

Book Details

Book Quality:

Publisher Quality

ISBN-13:

9780429644115

Related ISBNs:

9780429428890, 9781466533875, 9781439898130, 9781439825655, 9781439825648

Publisher:

CRC Press

Date of Addition:

12/04/24

Copyrighted By:

Taylor & Francis Group, LLC

Adult content:

No

Language:

English

Has Image Descriptions:

No

Categories:

Nonfiction, Computers and Internet, Mathematics and Statistics

Submitted By:

Bookshare Staff

Usage Restrictions:

This is a copyrighted book.