Mathematics for the analysis of algorithms

By:

Greene, Daniel H

Contributor(s):

Knuth, Donald E [Co-author]

Series: Modern Birkhäuser ClassicsPublication details: Boston: Birkhäuser, 2008Edition: 3rd edDescription: viii,132p. pbk. 21cmISBN:

9780817647285

Subject(s):

DDC classification:

518.1 GRE

Summary: This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is terse enough for easy reference yet detailed enough for those with little background. Approximately half the book is devoted to original problems and solutions from examinations given at Stanford. https://link.springer.com/book/10.1007/978-0-8176-4729-2

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Copy number	Status	Date due	Barcode
Books	IIT Gandhinagar	518.1 GRE (Browse shelf(Opens below))	1	Available		032955

Browsing IIT Gandhinagar shelves Close shelf browser (Hides shelf browser)

Previous								Next
Previous	518.1 MIT Probability and computing:	518.1 BLE Poems that solve puzzles: the history and science of algorithms	518.1 GRA Discrete Calculus: Applied Analysis on Graphs for Computational Science	518.1 GRE Mathematics for the analysis of algorithms	518.1 MIT Probability and computing: randomized algorithms and probabilistic analysis	518.2 PRE Numerical recipes in fortran: the art of scientific computing	518.2 RAM Numerical methods	Next

This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is terse enough for easy reference yet detailed enough for those with little background. Approximately half the book is devoted to original problems and solutions from examinations given at Stanford.
https://link.springer.com/book/10.1007/978-0-8176-4729-2

There are no comments on this title.

to post a comment.