Stephen Cook

Person

A mathematician whose work on the satisfiability problem was instrumental in showing that it is 'as hard as any problem in the class P' and led to understanding NP-completeness.

Mentioned in 2 videos

Videos Mentioning Stephen Cook

Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111

Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111

Lex Fridman

A mathematician whose work on the satisfiability problem was instrumental in showing that it is 'as hard as any problem in the class P' and led to understanding NP-completeness.

Brian Kernighan: UNIX, C, AWK, AMPL, and Go Programming | Lex Fridman Podcast #109

Brian Kernighan: UNIX, C, AWK, AMPL, and Go Programming | Lex Fridman Podcast #109

Lex Fridman

Showed that there were classes of problems (like graph partitioning) that appeared to be really hard, related to NP-completeness.