Ernst L. Leiss

A Programmer's Companion to Algorithm Analysis (eBook, PDF)

• Format: PDF

Produktbeschreibung

Focusing on practical issues, A Programmer's Companion to Algorithm Analysis bridges the gap between algorithms and software programs. This book explains the fundamental differences between the computational model assumed for algorithms and the real architectures in which programs execute. It highlights the pitfalls that can occur when implementing an algorithm as software and offers suggestions to solve these problems. The book also explores the interactions among program, compiler, and run-time support system, contrasting this with the simpler model assumed for algorithms. Intended for software developers and programmers, it places particular emphasis on the implications of the memory hierarchy on program efficiency.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Taylor & Francis
• Seitenzahl: 255
• Erscheinungstermin: 26. September 2006
• Englisch
• ISBN-13: 9781420011708
• Artikelnr.: 37875936

Autorenporträt

Ernst L. Leiss

Inhaltsangabe

A Taxonomy of Algorithmic Complexity. Fundamental Assumptions Underlying
Algorithmic Complexity. Examples of Complexity Analysis. Sources of
Disappointments. Implications of Nonuniform Memory for Software.
Implications of Compiler and Systems Issues for Software. Implicit
Assumptions. Implications of the Finiteness of the Representation of
Numbers. Asymptotic Complexities and the Selection of Algorithms.
Infeasibility and Undecidability: Implications for Software Development.
Appendix I: Algorithms Every Programmer Should Know. Appendix II: Overview
of Systems Implicated in Program Analysis. Appendix III: NP-Completeness
and Higher Complexity Classes. Appendix IV: Review of Undecidability.
Bibliography. Index.