• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Mathematics for the Analysis of Algorithms

Mathematics for the Analysis of Algorithms

Paperback

Series: Modern Birkhäuser Classics

General ComputersGeneral Mathematics

ISBN10: 0817647287
ISBN13: 9780817647285
Publisher: Springer Nature
Published: Oct 5 2007
Pages: 132
Weight: 0.50
Height: 0.50 Width: 6.10 Depth: 9.00
Language: English

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.

Also in

General Computers