-- Leo's gemini proxy
-- Connecting to rocketcaster.xyz:1965...
-- Connected
-- Sending request
-- Meta line: 20 text/gemini
By Lex Fridman
Published July 26, 2020 10:49am
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-compl...
-- Response ended
-- Page fetched on Sat May 18 19:07:25 2024