#111 – Richard Karp: Algorithms and Computational Complexity
Lex Fridman PodcastRichard 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 and the P vs NP problem.
Support this podcast by supporting our sponsors:
- Eight Sleep: https://eightsleep.com/lex
- Cash App –
0
(-)
Rate this episode:
Episode mentions
You can listen to this podcast, but not everything mentioned in it has been defined yet. Upvote it if you want it to be added next - the most voted podcasts will be added as soon as possible
People mentions
Transcript
To see the rest of the transcript, you must sign in