"In computational complexity theory, the Cook\u2013Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete."@en .