#111 – Richard Karp: Algorithms and Computational Complexity

Bu bölüm hakkında

<p>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 &#8220;Reducibility Among Combinatorial Problems&#8221;, 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.</p> <p>Support this podcast by supporting our sponsors:<br /> &#8211; Eight Sleep: <a href="https://eightsleep.com/lex">https://eightsleep.com/lex</a><br /> &#8211; Cash App – use code &#8220;LexPodcast&#8221; and download:<br /> &#8211; Cash App (App Store): <a href="https://apple.co/2sPrUHe">https://apple.co/2sPrUHe</a><br /> &#8211; Cash App (Google Play): <a href="https://bit.ly/2MlvP5w">https://bit.ly/2MlvP5w</a></p> <p>If you would like to get more information about this podcast go to <a href="https://lexfridman.com/ai">https://lexfridman.com/ai</a> or connect with @lexfridman on <a href="https://twitter.com/lexfridman">Twitter</a>, <a href="https://www.linkedin.com/in/lexfridman/">LinkedIn</a>, <a href="https://www.facebook.com/lexfridman">Facebook</a>, <a href="https://medium.com/@lexfridman">Medium</a>, or <a href="https://www.youtube.com/lexfridman">YouTube</a> where you can watch the video versions of these conversations. If you enjoy the podcast, please rate it 5 stars on <a href="https://podcasts.apple.com/us/podcast/artificial-intelligence/id1434243584">Apple Podcasts</a>, follow on <a href="https://open.spotify.com/show/2MAi0BvDc6GTFvKFPXnkCL">Spotify</a>, or support it on <a href="https://www.patreon.com/lexfridman">Patreon</a>.</p> <p>Here&#8217;s the outline of the episode. On some podcast players you should be able to click the timestamp to jump to that time.</p> <p>OUTLINE:<br /> 00:00 &#8211; Introduction<br /> 03:50 &#8211; Geometry<br /> 09:46 &#8211; Visualizing an algorithm<br /> 13:00 &#8211; A beautiful algorithm<br /> 18:06 &#8211; Don Knuth and geeks<br /> 22:06 &#8211; Early days of computers<br /> 25:53 &#8211; Turing Test<br /> 30:05 &#8211; Consciousness<br /> 33:22 &#8211; Combinatorial algorithms<br /> 37:42 &#8211; Edmonds-Karp algorithm<br /> 40:22 &#8211; Algorithmic complexity<br /> 50:25 &#8211; P=NP<br /> 54:25 &#8211; NP-Complete problems<br /> 1:10:29 &#8211; Proving P=NP<br /> 1:12:57 &#8211; Stable marriage problem<br /> 1:20:32 &#8211; Randomized algorithms<br /> 1:33:23 &#8211; Can a hard problem be easy in practice?<br /> 1:43:57 &#8211; Open problems in theoretical computer science<br /> 1:46:21 &#8211; A strange idea in complexity theory<br /> 1:50:49 &#8211; Machine learning<br /> 1:56:26 &#8211; Bioinformatics<br /> 2:00:37 &#8211; Memory of Richard&#8217;s father</p>