Non-Fiction Books:

Mathematics for the Analysis of Algorithms

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

Format:

Paperback / softback
$174.99
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks

Buy Now, Pay Later with:

4 payments of $43.75 with Afterpay Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 11-21 June using International Courier

Description

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.
Release date Australia
October 5th, 2007
Audiences
  • Postgraduate, Research & Scholarly
  • Undergraduate
Edition
Reprint of the 1990 ed.
Illustrations
VIII, 132 p.
Pages
132
Dimensions
156x234x7
ISBN-13
9780817647285
Product ID
2041982

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Help & options

Filed under...