HOME | BESTSELLERS | NEW RELEASES | PRICE WATCH | FICTION | BIOGRAPHIES | E-BOOKS |
+ PRICE WATCH
* Amazon pricing is not included in price watch
Mathematics for the Analysis of Algorithms (Modern Birkhäuser Classics) Book
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. Read More
from£54.99 | RRP: * Excludes Voucher Code Discount Also available Used from £71.11
- 0817647287
- 9780817647285
- Daniel H. Greene, Donald E. Knuth
- 5 November 2007
- Birkhauser
- Paperback (Book)
- 132
- Reprint of the 1990 ed.
As an Amazon Associate we earn from qualifying purchases. If you click through any of the links below and make a purchase we may earn a small commission (at no extra cost to you). Click here to learn more.
Would you like your name to appear with the review?
We will post your book review within a day or so as long as it meets our guidelines and terms and conditions. All reviews submitted become the licensed property of www.find-book.co.uk as written in our terms and conditions. None of your personal details will be passed on to any other third party.
All form fields are required.