{"product_id":"guide-to-algorithm-design","title":"Guide to Algorithm Design","description":"\u003cp\u003ePresenting a complementary perspective to standard books on algorithms, \u003cstrong\u003eA Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis\u003c\/strong\u003e 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.\u003c\/p\u003e\u003cp\u003eDivided 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.\u003c\/p\u003e\u003cul\u003e\n\u003cli\u003e\n\u003cp\u003e \u003c\/p\u003e \u003c\/li\u003e\n\u003cli\u003ePart I helps readers understand the main design principles and design efficient algorithms.\u003c\/li\u003e\n\u003cli\u003ePart II covers polynomial reductions from NP-complete problems and approaches that go beyond NP-completeness.\u003c\/li\u003e\n\u003cli\u003ePart III supplies readers with tools and techniques to evaluate problem complexity, including how to determine which instances are polynomial and which are NP-hard.\u003c\/li\u003e\n\u003c\/ul\u003e\u003cp\u003eDrawing 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.\u003c\/p\u003e","brand":"Taylor \u0026 Francis Inc","offers":[{"title":"Default Title","offer_id":54224604332376,"sku":"9781439825648","price":104.99,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0278\/1295\/4195\/files\/9781439825648.jpg?v=1777089648","url":"https:\/\/agendabookshop.com\/products\/guide-to-algorithm-design","provider":"Agenda Bookshop","version":"1.0","type":"link"}