The Cook-Levin Theorem, also known as the Cook's theorem, establishes that the Boolean satisfiability problem (SAT) is NP-complete, serving as the first known problem to be classified as such. This theorem laid the groundwork for the theory of NP-completeness, showing that if SAT can be solved in polynomial time, then every problem in NP can also be solved in polynomial time.