menu
{ "item_title" : "Mathematics for the Analysis of Algorithms", "item_author" : [" Daniel H. Greene", "Donald E. Knuth "], "item_description" : "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. The book contains a wealth of highly original, instructive problems and solutions taken from actual examinations given at Stanford in various computer science courses.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/0/81/764/728/0817647287_b.jpg", "price_data" : { "retail_price" : "79.99", "online_price" : "79.99", "our_price" : "79.99", "club_price" : "79.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Mathematics for the Analysis of Algorithms|Daniel H. Greene

Mathematics for the Analysis of Algorithms

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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. The book contains a wealth of highly original, instructive problems and solutions taken from actual examinations given at Stanford in various computer science courses.

This item is Non-Returnable

Details

  • ISBN-13: 9780817647285
  • ISBN-10: 0817647287
  • Publisher: Birkhauser
  • Publish Date: October 2007
  • Dimensions: 9 x 6.1 x 0.5 inches
  • Shipping Weight: 0.5 pounds
  • Page Count: 132

Related Categories

You May Also Like...

    1

BAM Customer Reviews