@online{huang2024cook,
  author       = {Huang, Xuanqiang Angelo},
  title        = {Cook-Levin and Savitch},
  date         = {2024-05-25},
  organization = {Xuanqiang Angelo Huang's Blog},
  url          = {https://flecart.github.io/notes/cook-levin-and-savitch/},
  langid       = {english},
  abstract     = {Cook Levin theorem is important because says that in 1971 if S A T ∈ P then N P = P . We will start with this idea to define the concept of NP-completeness . Let's start with the basics. Poly-reduction \# Def: poly-reduction \# We say that two languages L and L ′ defines over alpha}
}