Full episode with Richard Karp (Jul 2020): [ Ссылка ]
Clips channel (Lex Clips): [ Ссылка ]
Main channel (Lex Fridman): [ Ссылка ]
(more links below)
Podcast full episodes playlist:
[ Ссылка ]
Podcasts clips playlist:
[ Ссылка ]
Podcast website:
[ Ссылка ]
Podcast on Apple Podcasts (iTunes):
[ Ссылка ]
Podcast on Spotify:
[ Ссылка ]
Podcast RSS:
[ Ссылка ]
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 YouTube channel or connect on:
- Twitter: [ Ссылка ]
- LinkedIn: [ Ссылка ]
- Facebook: [ Ссылка ]
- Instagram: [ Ссылка ]
- Medium: [ Ссылка ]
- Support on Patreon: [ Ссылка ]
