
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solid and relevant base of mathematical skills - the skills needed to solve complex problems, to evaluate horrendous sums, and to discover subtle patterns in data. It is an indispensable text and reference not only for computer scientists - the authors themselves rely heavily on it! - but for serious users of mathematics in virtually every discipline.
This book investigates the foundational mathematical techniques required to analyze algorithms and solve complex computational problems. The authors, Ronald Graham, Donald Knuth, and Oren Patashnik, leverage their extensive expertise in discrete mathematics to provide a rigorous framework for understanding sums, recurrences, and generating functions. The text emphasizes the practical application of these mathematical tools within the context of computer science, bridging the gap between abstract theory and algorithmic implementation.
What You Will Find
Experts and academics widely recognize this work as a foundational text for students and professionals in computer science. Readers frequently note the high level of mathematical rigor and the density of the technical prose, which requires significant study to master.
Page Count:
0
Publication Date:
1991-12-01
Publisher:
Addison-Wesley Longman, Incorporated
ISBN-10:
0201556502
ISBN-13:
9780201556506
No comments yet. Be the first to share your thoughts!