Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111
Richard Karp discusses the beauty and elegance of algorithms and how visualization helps understand computational processes
Richard Karp
1 episode on Lex Fridman Podcast
Richard Karp is a renowned theoretical computer scientist and Professor at UC Berkeley who received the Turing Award in 1985. He is best known for developing fundamental algorithms in network flow and graph theory, and for his seminal work proving 21 problems to be NP-complete, which catalyzed the modern study of computational complexity.