This document provides definitions and formulas from theoretical computer science, including: 1. Big O, Omega, and Theta notation for analyzing algorithm complexity. 2. Common series like geometric and harmonic series. 3. Recurrence relations and methods for solving them like the master theorem. 4. Combinatorics topics like permutations, combinations, and binomial coefficients. - Download as a PDF or view online for free
