Mathematics for the Analysis of Algorithms Paperback - 2007
by Daniel H. Greene; Donald E. Knuth
From the rear cover
A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. 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.
"...a very valuable collection of mathematical techniques for the analysis of algorithms..." -- Mathematical Reviews
"The book covers the important mathematical tools used in computer science, especially in the exact analysis of algorithms. A wide range of topics are covered, from the binomial theorem to the saddle point method and Laplace's techniques for asymptotic analysis...The book is very well written. The style and the mathematical exposition make the book pleasant to read...It covers many of the major paradigms used in the analysis of algorithms in its one hundred plus pages." -- SIAM Review
"The book presents a welcome selection a
nd careful exposition of material that can be (and is) covered in a single course...In this reviewer's opinion, this would be an interesting text to use with a group of advanced students well-grounded in undergraduate mathematics and computer science, and would produce a valuable course for the participating students." -- Computing ReviewsDetails
- Title Mathematics for the Analysis of Algorithms
- Author Daniel H. Greene; Donald E. Knuth
- Binding Paperback
- Edition U. S. EDITION
- Pages 132
- Volumes 1
- Language ENG
- Publisher Birkhauser
- Date 2007-10-05
- Illustrated Yes
- Features Bibliography, Illustrated, Index
- ISBN 9780817647285 / 0817647287
- Weight 0.5 lbs (0.23 kg)
- Dimensions 9 x 6.1 x 0.5 in (22.86 x 15.49 x 1.27 cm)
- Library of Congress subjects Computer algorithms, Computer programming - Mathematics
- Library of Congress Catalog Number 2007936766
- Dewey Decimal Code 004.015
More Copies for Sale
Mathematics for the Analysis of Algorithms (Modern Birkhuser Classics)
by Greene, Daniel H.
- Used
- Condition
- UsedAcceptable
- ISBN 10 / ISBN 13
- 9780817647285 / 0817647287
- Quantity Available
- 1
- Seller
-
Brooklyn Park, Minnesota, United States
- Item Price
-
A$76.60A$4.58 shipping to USA
Show Details
Mathematics for the Analysis of Algorithms
by Daniel H. Greene
- New
- Condition
- New
- ISBN 10 / ISBN 13
- 9780817647285 / 0817647287
- Quantity Available
- 340
- Seller
-
Uxbridge, Greater London, United Kingdom
- Item Price
-
A$112.03A$15.52 shipping to USA
Show Details
Mathematics for the Analysis of Algorithms
by Daniel H. Greene
- New
- Paperback
- Condition
- New
- Binding
- Paperback
- ISBN 10 / ISBN 13
- 9780817647285 / 0817647287
- Quantity Available
- 10
- Seller
-
Southport, Merseyside, United Kingdom
- Item Price
-
A$139.87A$19.33 shipping to USA
Show Details
Mathematics for the Analysis of Algorithms (Modern Birkhäuser Classics)
by Greene, Daniel H.
- Used
- Good
- Paperback
- Condition
- Used - Good
- Binding
- Paperback
- ISBN 10 / ISBN 13
- 9780817647285 / 0817647287
- Quantity Available
- 1
- Seller
-
Newport Coast, California, United States
- Item Price
-
A$153.72FREE shipping to USA