The Most Beautiful Algorithm | Richard Karp and Lex Fridman

Full episode with Richard Karp (Jul 2020): • Richard Karp: Algorith...
Clips channel (Lex Clips): / lexclips
Main channel (Lex Fridman): / lexfridman
(more links below)
Podcast full episodes playlist:
• Lex Fridman Podcast
Podcasts clips playlist:
• Lex Fridman Podcast Clips
Podcast website:
lexfridman.com/ai
Podcast on Apple Podcasts (iTunes):
apple.co/2lwqZIr
Podcast on Spotify:
spoti.fi/2nEwCF8
Podcast RSS:
lexfridman.com...
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 and the P vs NP problem.
Subscribe to this RUclips channel or connect on:
Twitter: / lexfridman
LinkedIn: / lexfridman
Facebook: / lexfridman
Instagram: / lexfridman
Medium: / lexfridman
Support on Patreon: / lexfridman

[@CallMeEsteban]

I watch Lex when I want to feel like I’m getting smart and learning. Keep up the great work brother!

[@paragggoyal1552]

wow, my first thought was to find all permutations, then i reduced it to, bitmask DP.
But this way just took my breath away! i will definitely read about this algorithm.
It's just so beautiful. Thats why i changed my career