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

A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis

A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis Hardback - 2013

by Yves Robert

Add to wish list
  • New
  • Hardback
New

Description

Hardback. New.
Ask the seller a question Add to wish list
A$177.51
A$19.20 Delivery to USA
Standard delivery: 14 to 21 days
More delivery options
Ships from The Saint Bookstore (Merseyside, United Kingdom)
Biblio Top Seller
The BIBLIO Guarantee

Details

  • Title A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis
  • Author Yves Robert
  • Binding Hardback
  • Condition New
  • Pages 362
  • Language ENG
  • Publisher CRC Press
  • Publication date 2013
  • Features Bibliography, Illustrated, Index
  • Bookseller's Inventory # A9781439825648
  • ISBN 9781439825648
  • Themes
    • Aspects (Academic): Science/Technology Aspects
  • Quantity available 1

About The Saint Bookstore Merseyside, United Kingdom

Specialising in: Academic & Scholarly, Hard To Find Titles, Textbooks
Biblio member since 2018

The Saint Bookstore specialises in hard to find titles & also offers delivery worldwide for reasonable rates.

Terms of Sale: Refunds or Returns: A full refund of the price paid will be given if returned within 30 days in undamaged condition. If the product is faulty, we may send a replacement.

Browse books from The Saint Bookstore

Reader reviews for A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

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

Please wait a moment while we load the requested page.

tracking-