A guide to algorithm design : paradigms, methods, and complexity analysis /

Saved in:

Bibliographic Details
Author / Creator:	Benoit, Anne, author.
Imprint:	Boca Raton : CRC Press, [2014] ©2014
Description:	1 online resource : text file, PDF.
Language:	English
Series:	Chapman & Hall/CRC Applied Algorithms and Data Structures series Chapman & Hall/CRC applied algorithms and data structures series.
Subject:	Computer algorithms. Computational complexity. Algorithms. Algorithms Computational complexity Computer algorithms
Format:	E-Resource Book
URL for this record:	http://pi.lib.uchicago.edu/1001/cat/bib/13647084

Hidden Bibliographic Details
Other authors / contributors:	Robert, Yves, 1958 September 5- author. Vivien, Frédéric, author.
ISBN:	9781439898130 1439898138 9781439825648 1439825645 9781439898147 1439898146 9781466533875 1466533870 9781439825655 1439825653
Notes:	Includes bibliographical references and index.
Summary:	Polynomial-Time Algorithms: Exercises Introduction to Complexity On the complexity to compute xnAsymptotic notations: O, o, Θ, and ΩDivide-and-Conquer Strassen's algorithm Master theorem Solving recurrencesGreedy Algorithms Motivating example: the sports hall Designing greedy algorithms Graph coloringTheory of matroidsDynamic Programming The coin changing problem The knapsack problem Designing dynamic-programming algorithmsAmortized AnalysisMethods for amortized analysisExercises, Solutions, and Bibliographic Notes appear at the end of each chapter in this section. NP-Completeness and Beyond NP.
Other form:	Print version: 9781439825648 1439825645

Similar Items