NP-Completeness | Richard Karp and Lex Fridman
Full episode with Richard Karp (Jul 2020): https://www.youtube.com/watch?v=KllCrlfLuzs
Clips channel (Lex Clips): https://www.youtube.com/lexclips
Main channel (Lex Fridman): https://www.youtube.com/lexfridman
(more links below)
Podcast full episodes playlist:
https://www.youtube.com/playlist?list=PLrAXtmErZgOdP_8GztsuKi9nrraNbKKp4
Podcasts clips playlist:
https://www.youtube.com/playlist?list=PLrAXtmErZgOeciFP3CBCIEElOJeitOr41
Podcast website:
https://lexfridman.com/ai
Podcast on Apple Podcasts (iTunes):
https://apple.co/2lwqZIr
Podcast on Spotify:
https://spoti.fi/2nEwCF8
Podcast RSS:
https://lexfridman.com/category/ai/feed/
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: https://twitter.com/lexfridman
- LinkedIn: https://www.linkedin.com/in/lexfridman
- Facebook: https://www.facebook.com/lexfridman
- Instagram: https://www.instagram.com/lexfridman
- Medium: https://medium.com/@lexfridman
- Support on Patreon: https://www.patreon.com/lexfridman
Видео NP-Completeness | Richard Karp and Lex Fridman канала Lex Clips
Clips channel (Lex Clips): https://www.youtube.com/lexclips
Main channel (Lex Fridman): https://www.youtube.com/lexfridman
(more links below)
Podcast full episodes playlist:
https://www.youtube.com/playlist?list=PLrAXtmErZgOdP_8GztsuKi9nrraNbKKp4
Podcasts clips playlist:
https://www.youtube.com/playlist?list=PLrAXtmErZgOeciFP3CBCIEElOJeitOr41
Podcast website:
https://lexfridman.com/ai
Podcast on Apple Podcasts (iTunes):
https://apple.co/2lwqZIr
Podcast on Spotify:
https://spoti.fi/2nEwCF8
Podcast RSS:
https://lexfridman.com/category/ai/feed/
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: https://twitter.com/lexfridman
- LinkedIn: https://www.linkedin.com/in/lexfridman
- Facebook: https://www.facebook.com/lexfridman
- Instagram: https://www.instagram.com/lexfridman
- Medium: https://medium.com/@lexfridman
- Support on Patreon: https://www.patreon.com/lexfridman
Видео NP-Completeness | Richard Karp and Lex Fridman канала Lex Clips
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
16. Complexity: P, NP, NP-completeness, ReductionsP vs NP on TV - ComputerphileWhy Most P vs. NP Attempts FailNP-Complete Reductions: Clique, Independent Set, Vertex Cover, and Dominating SetRichard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111What Makes Mario NP-Hard? (Polynomial Reductions)Donald Knuth: P=NP | AI Podcast ClipsBeyond Computation: The P versus NP question (panel discussion)Eric Weinstein's Harvard Story - The System Breaks Down in Novel Situations | AI Podcast ClipsP vs. NP - The Biggest Unsolved Problem in Computer ScienceAre There Problems That Computers Can't Solve?Does P=NP? | Richard Karp and Lex FridmanNP-Complete Explained (Cook-Levin Theorem)Ray Dalio: What Elon Musk, Steve Jobs, and Other Shapers Have in Common | AI Podcast ClipsSean Carroll: The Nature of the Universe, Life, and Intelligence | Lex Fridman Podcast #26Bjarne Stroustrup: C++ Concepts - Constraints on Template ParametersBjarne Stroustrup: Deep Learning, Software 2.0, and Fuzzy ProgrammingMachine Learning at Spotify - Gustav Soderstrom | AI Podcast ClipsP NP NP-Hard NP-Complete||Design and Analysis of Algorithm || English ||By Studies Studio