Sold Out
Sold Out
Book Categories |
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.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionMathematics for the analysis of algorithms
X
This Item is in Your InventoryMathematics for the analysis of algorithms
X
You must be logged in to review the productsX
X
X
Add Mathematics for the analysis of algorithms, , Mathematics for the analysis of algorithms to the inventory that you are selling on WonderClubX
X
Add Mathematics for the analysis of algorithms, , Mathematics for the analysis of algorithms to your collection on WonderClub |