Buch, Englisch, 132 Seiten, Format (B × H): 157 mm x 237 mm, Gewicht: 232 g
Reihe: Modern Birkhäuser Classics
Buch, Englisch, 132 Seiten, Format (B × H): 157 mm x 237 mm, Gewicht: 232 g
Reihe: Modern Birkhäuser Classics
ISBN: 978-0-8176-4728-5
Verlag: Birkhauser Boston
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.
Zielgruppe
Graduate
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
Weitere Infos & Material
Binomial Identities.- Recurrence Relations.- Operator Methods.- Asymptotic analysis.