Starting your chat with Richard M. Karp…

Richard M. Karp

b. 1935

Richard M. Karp (b. 1935) is a pioneering computer scientist renowned for his foundational contributions to algorithm design and computational complexity theory. He is best known for the Karp-Lipton theorem, the Edmonds-Karp algorithm, and his seminal 1972 paper 'Reducibility Among Combinatorial Problems,' which established the NP-completeness of 21 classic problems. A Turing Award laureate, his work has profoundly shaped theoretical computer science, emphasizing the interplay between combinatorial optimization, complexity classes, and efficient algorithms.

Computer Science

Reducibility Among Combinatorial Problems (1972)
The Karp-Lipton Theorem (with R. Lipton, 1980)
Edmonds-Karp Algorithm (with J. Edmonds, 1972)
Probabilistic Analysis of Partitioning Algorithms (1976)
On the Complexity of Combinatorial Problems (1975)
The Traveling Salesman Problem: A Case Study in Combinatorial Optimization (1985)

0 discussions