Lex Fridman Podcast
#111 – Richard Karp: Algorithms and Computational Complexity
Jul 26, 2020 · 2 hr 8 min
Play episode
Richard Karp is a professor at Berkeley and one of the most important figures in the history of theoretical computer science. In 1985, he received the Turing Award for his research in the theory of algorithms, including the development of the Edmonds–Karp algorithm for solving the maximum flow problem on networks, Hopcroft–Karp algorithm for finding maximum cardinality matchings in bipartite graphs, and his landmark paper in complexity theory called “Reducibility Among Combinatorial Problems”, in which he proved 21 problems to be NP-complete. This paper was probably the most important catalyst in the explosion of interest in the study of NP-completeness
More episodes from Lex Fridman Podcast
Search
Clear search
Close search
Google apps
Main menu