7333630

9781420068290

Methods in Algorithmic Analysis (Chapman & Hall/Crc Computer and Information Science)
Methods in Algorithmic Analysis (Chapman & Hall/Crc Computer and Information Science)
$53.69
$3.95 Shipping
List Price
$89.95
Discount
40% Off
You Save
$36.26

  • Condition: New
  • Provider: Ergodebooks Contact
  • Provider Rating:
    83%
  • Ships From: Multiple Locations
  • Shipping: Standard
  • Comments: Buy with confidence. Excellent Customer Service & Return policy. Ships Fast. Expedite Shipping Available.

   30-day money back guarantee
$10.70
$3.95 Shipping
List Price
$89.95
Discount
88% Off
You Save
$79.25

  • Condition: Very Good
  • Provider: oneplanetbooks Contact
  • Provider Rating:
    96%
  • Ships From: Columbia, MO
  • Shipping: Standard, Expedited
  • Comments: Book is used but in very good shape

   30-day money back guarantee

Ask the provider about this item.

Most renters respond to questions in 48 hours or less.
The response will be emailed to you.
Cancel
  • ISBN-13: 9781420068290
  • ISBN: 1420068296
  • Edition: 1
  • Publication Date:
  • Publisher: C R C Press LLC

AUTHOR

SUMMARY

Explores the Impact of the Analysis of Algorithms on Many Areas within and beyond Computer Science A flexible, interactive teaching format enhanced by a large selection of examples and exercisesDeveloped from the author's own graduate-level course, Methods in Algorithmic Analysis presents numerous theories, techniques, and methods used for analyzing algorithms. It exposes students to mathematical techniques and methods that are practical and relevant to theoretical aspects of computer science.After introducing basic mathematical and combinatorial methods, the text focuses on various aspects of probability, including finite sets, random variables, distributions, Bayes' theorem, and Chebyshev inequality. It explores the role of recurrences in computer science, numerical analysis, engineering, and discrete mathematics applications. The author then describes the powerful tool of generating functions, which is demonstrated in enumeration problems, such as probabilistic algorithms, compositions and partitions of integers, and shuffling. He also discusses the symbolic method, the principle of inclusion and exclusion, and its applications. The book goes on to show how strings can be manipulated and counted, how the finite state machine and Markov chains can help solve probabilistic and combinatorial problems, how to derive asymptotic results, and how convergence and singularities play leading roles in deducing asymptotic information from generating functions. The final chapter presents the definitions and properties of the mathematical infrastructure needed to accommodate generating functions.Accompanied by more than 1,000 examples and exercises, this comprehensive, classroom-tested text develops students' understanding of the mathematical methodology behind the analysis of algorithms. It emphasizes the important relation between continuous (classical) mathematics and discrete mathematics, which is the basis of computer science.Dobrushkin, Vladimir A. is the author of 'Methods in Algorithmic Analysis (Chapman & Hall/Crc Computer and Information Science)', published 2009 under ISBN 9781420068290 and ISBN 1420068296.

[read more]

Questions about purchases?

You can find lots of answers to common customer questions in our FAQs

View a detailed breakdown of our shipping prices

Learn about our return policy

Still need help? Feel free to contact us

View college textbooks by subject
and top textbooks for college

The ValoreBooks Guarantee

The ValoreBooks Guarantee

With our dedicated customer support team, 30-day no-questions-asked return policy, and our price match guarantee, you can rest easy knowing that we're doing everything we can to save you time, money, and stress.