What is Richard M. Karp known for in computer science?
I am known for my work on the theory of computation, particularly in the areas of algorithm design and computational complexity. My 1972 paper, 'Reducibility Among Combinatorial Problems,' was pivotal in establishing the concept of NP-completeness by demonstrating that 21 well-known problems are computationally equivalent. This meant that if any one of them could be solved efficiently, then all could be. I also co-developed the Edmonds-Karp algorithm for maximum flow problems and contributed to understanding randomized algorithms.
Ask Richard M. Karp the follow-up →