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,759
Discovery Miles 27 590
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,759 Discovery Miles 27 590 | Repayment Terms: R259 pm x 12*

Bookmark and Share

Expected to ship within 12 - 19 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..

Data Abstraction and Problem Solving…
Janet Prichard, Frank Carrano Paperback R2,421 Discovery Miles 24 210
Coding for Kids in Python - Python…
Bob Mather Hardcover R917 Discovery Miles 9 170
Gamma Solution - An Application of…
James R Warren Hardcover R1,338 R1,131 Discovery Miles 11 310
C Programming - C Programming Language…
Adam Dodson Hardcover R598 R542 Discovery Miles 5 420
A Textbook of Data Structures and…
Vijayalakshmi P Hardcover R3,817 Discovery Miles 38 170
Genetic Algorithms with Python
Clinton Sheppard Hardcover R911 R858 Discovery Miles 8 580
Image Analysis, Classification and…
Morton John Canty Paperback R1,540 Discovery Miles 15 400
MATLAB Applications in Engineering
Constantin Volosencu Hardcover R3,310 Discovery Miles 33 100
The Application of Ant Colony…
Ali Soofastaei Hardcover R2,765 Discovery Miles 27 650
Python Programming for Computations…
Computer Language Hardcover R1,216 R1,024 Discovery Miles 10 240
Dual-Pivot Quicksort and Beyond…
Sebastian Wild Hardcover R1,311 Discovery Miles 13 110
What's Where in the APPLE - Enhanced…
Bill Martens, Brian Wiser, … Hardcover R1,861 Discovery Miles 18 610

See more

Partners