A programmer's companion to algorithm analysis
by
 
Leiss, Ernst L., 1952, author.

Title
A programmer's companion to algorithm analysis

Author
Leiss, Ernst L., 1952, author.

ISBN
9780429140419

Physical Description
1 online resource (255 pages)

Contents
chapter Part 1. The Algorithm Side: Regularity, Predictability, and Asymptotics -- chapter 1 A Taxonomy of Algorithmic Complexity -- chapter 2 Fundamental Assumptions Underlying Algorithmic Complexity -- chapter 3 Examples of Complexity Analysis -- chapter Part 2. The Software Side: Disappointments and How to Avoid Them -- chapter 4 Sources of Disappointments -- chapter 5 Implications of Nonuniform Memory for Software -- chapter 6 Implications of Compiler and Systems Issues for Software -- chapter 7 Implicit Assumptions -- chapter 8 Implications of the Finiteness of the Representation of Numbers -- chapter 9 Asymptotic Complexities and the Selection of Algorithms -- chapter 10 0 Infeasibility and Undecidability: Implications for Software Development -- chapter Part 3. Conclusion.

Subject Term
Programming (Mathematics)
 
Algorithms -- Data processing.

Electronic Access
Click here to view.


LibraryMaterial TypeItem BarcodeShelf Number[[missing key: search.ChildField.HOLDING]]Status
Online LibraryE-Book541032-1001QA402.5 .L398 2007CRC E-Books