Mathematics for the analysis of algorithms
Daniel H Greene, Donald Ervin Knuth
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
Kategoriler:
Yıl:
1982
Baskı:
2nd ed
Yayımcı:
Birkhäuser
Dil:
english
Sayfalar:
123
ISBN 10:
376433102X
ISBN 13:
9783764331023
Seriler:
Progress in computer science, no. 1
Dosya:
PDF, 4.29 MB
IPFS:
,
english, 1982
Bu kitap, telif hakkı sahibinin şikayeti nedeniyle indirilememektedir
Beware of he who would deny you access to information, for in his heart he dreams himself your master
Dosyaları dönüştürün
Diğer arama sonuçları
Diğer avantajları 
