,

Mathematics for the Analysis of Algorithms

Paperback Engels 2007 3e druk 9780817647285
Verwachte levertijd ongeveer 9 werkdagen

Samenvatting

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.

Specificaties

ISBN13:9780817647285
Taal:Engels
Bindwijze:paperback
Aantal pagina's:132
Druk:3

Lezersrecensies

Wees de eerste die een lezersrecensie schrijft!

Inhoudsopgave

Binomial Identities.- Recurrence Relations.- Operator Methods.- Asymptotic analysis.

Managementboek Top 100

Rubrieken

    Personen

      Trefwoorden

        Mathematics for the Analysis of Algorithms