This 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.
Mathematics for the Analysis of Algorithms (Modern Birkhäuser Classics)
📄 Viewing lite version
Full site ›
Book Details
Author(s)Daniel H. Greene, Donald E. Knuth
PublisherBirkhäuser
ISBN / ASIN0817647287
ISBN-139780817647285
AvailabilityUsually ships in 24 hours
Sales Rank2,534,563
CategoryComputers
MarketplaceUnited States 🇺🇸
Description ▲
More Books in Computers
The Good Web Site Guide 2006: The Completely Revised, …
View
The Pentium Microprocessor
View
Advanced Intel Microprocessors: 80286, 80386, And 80486
View
Differential Equations: Matrices and Models
View
Digital Experiments: Emphasizing Troubleshooting (Merr…
View
Data Structures for Computer Information Systems
View
The Little LISPer, Third Edition
View
Inside Networks
View
Computer Graphics Using Open GL (2nd Edition)
View