SAT was the first known NP-complete problem, as proved by Stephen Cook at the University of Toronto in 1971 and independently by Leonid Levin at the Russian Academy of Sciences in 1973. (pdf) , translated into English by Until that time, the concept of an NP-complete problem did not even exist.
