Richard Karp
Richard Karp · Technology & Engineering
Foundational work on NP-completeness; Turing Award laureate.
1935, Boston, Massachusetts, USA
United States (Boston · Cambridge · Berkeley, California)
Richard Karp is recognized among Jewish contributors to Technology & Engineering — Foundational work on NP-completeness; Turing Award laureate.
Karp, raised in a Jewish family in Boston, earned his doctorate at Harvard and worked at IBM before joining Berkeley. In his 1972 paper he showed that 21 combinatorial problems are NP-complete, giving the theory of computational intractability its practical foundation and reshaping how computer scientists judge which problems are efficiently solvable. He received the Turing Award in 1985.
Verify and go deeper with these external references.
Source: Jinfo.org — Jews in Computer Science
Foundational work on NP-completeness; Turing Award laureate.
Source: Jinfo.org — Jews in Computer Science
Similar Contributors
Leslie Lamport
Avi Wigderson
Jeffrey Ullman
Yoshua Bengio
Edward Feigenbaum
