American mathematician Stephen Cook, while completing his PhD in Computer Science at the University of California at Berkeley, discovers the SAT (Satisfiability) for NP-Complete (Non-deterministic, Polynomially time-bounded) problems: solving any NP-complete problem is equivalent to solving any instance of SAT (by the year 2000, over 2000 different NP-complete problems were known).
