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
Windows XP, Vol. 1 (SELECT Series)
View
Internet Searching and Indexing: The Subject Approach
View
Control Problems in Industry: Proceedings from the SIA…
View
Open Source Systems Security Certification
View
Java: Data Structures and Programming
View
User-Centered Web Development
View
Query Processing in Database Systems (Topics in Inform…
View
Fundamentals of SQL Server 2005
View
Dreamweaver CS4: The Missing Manual (Spanish Edition)
View