0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Data structures

Buy Now

A Guide to Algorithm Design - Paradigms, Methods, and Complexity Analysis (Hardcover, New) Loot Price: R2,740
Discovery Miles 27 400
A Guide to Algorithm Design - Paradigms, Methods, and Complexity Analysis (Hardcover, New): Anne Benoit, Yves Robert, Frederic...

A Guide to Algorithm Design - Paradigms, Methods, and Complexity Analysis (Hardcover, New)

Anne Benoit, Yves Robert, Frederic Vivien

Series: Chapman & Hall/CRC Applied Algorithms and Data Structures series

 (sign in to rate)
Loot Price R2,740 Discovery Miles 27 400 | Repayment Terms: R257 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

General

Imprint: Crc Press
Country of origin: United States
Series: Chapman & Hall/CRC Applied Algorithms and Data Structures series
Release date: August 2013
First published: 2013
Authors: Anne Benoit • Yves Robert • Frederic Vivien
Dimensions: 234 x 156 x 26mm (L x W x T)
Format: Hardcover
Pages: 380
Edition: New
ISBN-13: 978-1-4398-2564-8
Categories: Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Computing & IT > Applications of computing > General
Promotions
LSN: 1-4398-2564-5
Barcode: 9781439825648

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Reachable Sets of Dynamic Systems…
Stanislaw Raczynski Paperback R3,927 Discovery Miles 39 270
Comprehensive Metaheuristics…
S. Ali Mirjalili, Amir Hossein Gandomi Paperback R3,956 Discovery Miles 39 560
A Textbook of Data Structures and…
Vijayalakshmi P Hardcover R3,522 Discovery Miles 35 220
MATLAB Applications in Engineering
Constantin Volosencu Hardcover R3,055 Discovery Miles 30 550
The Application of Ant Colony…
Ali Soofastaei Hardcover R2,553 Discovery Miles 25 530
Introduction to Chemical Engineering…
Henry C. Foley Paperback R3,120 Discovery Miles 31 200
A Textbook of Data Structures and…
Vijayalakshmi P Hardcover R3,522 Discovery Miles 35 220
Algorithms in Bioinformatics - Theory…
PA Gagniuc Hardcover R3,174 Discovery Miles 31 740
Coding for Kids in Python - Python…
Bob Mather Hardcover R851 Discovery Miles 8 510
Gamma Solution - An Application of…
James R Warren Hardcover R1,232 R1,048 Discovery Miles 10 480
GPU-based Parallel Implementation of…
Ying Tan Paperback R2,065 Discovery Miles 20 650
C Programming - C Programming Language…
Adam Dodson Hardcover R551 R505 Discovery Miles 5 050

See more

Partners