Randomized Algorithms | Richard Karp and 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:

[_eddiecole]

I went to the comment section to get clarity on the topic. And realized I'm the first person to comment. So I did what shinzen young calls "don't know mind"

[KekoaSkills]

You can’t imagine what you can’t imagine, think this is why mistakes in the creative process or “random changes” can spawn new stuff. In the last twenty years a few new styles of music have come into being that I did not see coming!