O tej e-knjigi
A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. 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.
Ocene in mnenja
4,3
3 mnenja
Ocenite to e-knjigo
Povejte nam svoje mnenje.
Informacije o branju
Pametni telefoni in tablični računalniki
Namestite aplikacijo Knjige Google Play za Android in iPad/iPhone. Samodejno se sinhronizira z računom in kjer koli omogoča branje s povezavo ali brez nje.
Prenosni in namizni računalniki
Poslušate lahko zvočne knjige, ki ste jih kupili v Googlu Play v brskalniku računalnika.
Bralniki e-knjig in druge naprave
Če želite brati v napravah, ki imajo zaslone z e-črnilom, kot so e-bralniki Kobo, morate prenesti datoteko in jo kopirati v napravo. Podrobna navodila za prenos datotek v podprte bralnike e-knjig najdete v centru za pomoč.
