Foundations of Algorithms, Richard E.Neapolitan Kumarss Naimipour, 1996

Price:

Rp 143.000

Quantity Order:

Payment Method:

Telegraphic Transfer (T/T)

Table of Contents
Ch. 1 Algorithms: Efficiency, Analysis, and Order 1
Ch. 2 Divide-and-Conquer 46
Ch. 3 Dynamic Programming 89
Ch. 4 The Greedy Approach 134
Ch. 5 Backtracking 176
Ch. 6 Branch-and-Bound 222
Ch. 7 Introduction to Computational Complexity: The Sorting Problem 257
Ch. 8 More Computational Complexity: The Searching Problem 307
Ch. 9 Computational Complexity and Intractability: An Introduction to the Theory of NP 363
Ch. 10 Introduction to Parallel Algorithms 405
Appendix A Review of Necessary Mathematics 431
Appendix B Solving Recurrence Equations: With Applications to Analysis of Recursive Algorithms 465
Appendix C Data Structures for Disjoint Sets 502
References 513
Index 517

Recommend to your friends