{"product_id":"mathematics-for-the-analysis-of-algorithms-paperback","title":"Mathematics for the Analysis of Algorithms - Paperback","description":"\u003cp\u003eby \u003cb\u003eDaniel H. Greene\u003c\/b\u003e (Author), \u003cb\u003eDonald E. Knuth\u003c\/b\u003e (Author)\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003eThis monograph collects some fundamental mathematical techniques that are required for the analysis of algorithms. It 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 concise enough for easy reference yet detailed enough for those with little background with the material. The book contains a wealth of highly original, instructive problems and solutions taken from actual examinations given at Stanford in various computer science courses.\u003c\/p\u003e\u003ch3\u003eBack Jacket\u003c\/h3\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003eA 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.\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e \u003cp\u003e\u003cem\u003e\"...a very valuable collection of mathematical techniques for the analysis of algorithms...\" \u003c\/em\u003e\u003cstrong\u003e-- Mathematical Reviews\u003c\/strong\u003e\u003c\/p\u003e \u003cp\u003e\u003cem\u003e\"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.\" \u003c\/em\u003e\u003cstrong\u003e\u003cem\u003e--\u003c\/em\u003e SIAM Review\u003c\/strong\u003e\u003c\/p\u003e \u003cp\u003e\u003cem\u003e\"The book presents a welcome selection a\u003c\/em\u003e\u003c\/p\u003end 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.\" \u003cstrong\u003e\u003cem\u003e--\u003c\/em\u003e Computing Reviews\u003c\/strong\u003e\u003cp\u003e\u003c\/p\u003e\u003cdiv\u003e\n\u003cstrong\u003eNumber of Pages:\u003c\/strong\u003e 132\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003eDimensions:\u003c\/strong\u003e 0.5 x 9 x 6.1 IN\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003eIllustrated:\u003c\/strong\u003e Yes\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003ePublication Date:\u003c\/strong\u003e October 05, 2007\u003c\/div\u003e","brand":"Books by splitShops","offers":[{"title":"Default Title","offer_id":42722499625023,"sku":"9780817647285","price":136.06,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0105\/8226\/1823\/files\/6556d2e6b0ac272090d7e0394a61ddc9.webp?v=1765095965","url":"https:\/\/dhlswag.com\/products\/mathematics-for-the-analysis-of-algorithms-paperback","provider":"BBB","version":"1.0","type":"link"}