Ernst L. Leiss (University of Houston, Texas, USA)

A Programmer's Companion to Algorithm Analysis

• Broschiertes Buch

Produktbeschreibung

Explains the fundamental differences between the computational model assumed for algorithms and the real architectures in which programs execute. This book highlights the pitfalls that can occur when implementing an algorithm as software and offers suggestions to solve these problems.

Produktdetails

• Verlag: Taylor & Francis Inc
• Seitenzahl: 272
• Erscheinungstermin: 26. September 2006
• Englisch
• Abmessung: 234mm x 156mm x 15mm
• Gewicht: 410g
• ISBN-13: 9781584886730
• ISBN-10: 1584886730
• Artikelnr.: 21089774

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.