Algorithm Analysis Reference

Discrete Math · Axiom Academy

FORMULA SHEET Algorithm Analysis Reference Complexity analysis, master theorem, and problem complexity classes COMPLEXITY HIERARCHY (FROM FASTEST TO SLOWEST) Clique - Finding k-clique in graph Vertex Cover - Minimum vertex cover Hamiltonian Cycle - Finding Hamiltonian path TSP - Traveling salesman problem Subset Sum - Sum to target value Knapsack - 0/1 knapsack decision Graph Coloring - k-colorability ASYMPTOTIC ANALYSIS PROPERTIES

This is the written version of the interactive lesson above. See the full Discrete Math course.