RMK

Richard M. Karp

Professor of Computer Science at University of California, Berkeley, pioneer in the field of computational complexity theory and algorithms, known for his work on NP-completeness and combinatorial optimization problems.

About

Richard M. Karp is a renowned American theoretical computer scientist and professor at the University of California, Berkeley.
He is best known for his seminal contributions to the theory of computational complexity, especially for identifying 21 NP-complete problems in his landmark 1972 paper.
His work laid the foundation for understanding computational intractability and significantly shaped the field of algorithms and optimization.
Karp has received numerous prestigious awards, including the Turing Award and the National Medal of Science, recognizing his impact on computer science.