Foundations of algorithms - Neapolitan, Richard E. (Burlington, MA : Jones & Bartlett Learning, 2015)
A.4. Theorems and Lemmas -- A.5. Logarithms -- A.5.1. Definition and Properties of Logarithms -- A.5.2. The Natural Logarithm -- A.6. Sets -- A.7. Permutations and Combinations -- A.8. Probability -- A.8.1. Randomness -- A.8.2. The Expected Value -- Exercises -- Appendix B Solving Recurrence Equations: With Applications to Analysis of Recursive Algorithms -- B.1. Solving Recurrences Using Induction -- B.2. Solving Recurrences Using the Characteristic Equation -- B.2.1. Homogeneous Linear Recurrences -- B.2.2. Nonhomogeneous Linear Recurrences -- B.2.3. Change of Variables (Domain Transformations) -- B.3. Solving Recurrences by Substitution -- B.4. Extending Results for n, a Power of a Positive Constant b, to n in General -- B.5. Proofs of Theorems -- Exercises -- Appendix C Data Structures for Disjoint Sets.
Includes bibliographical references (pages 653-658) and index.
Keywords: Algorithms; Constructive mathematics; Computational complexity