Skip to content
◈ALB Atlas

Richard Karp Alive

Richard Karp
KindPerson
Born1935
StatusAlive
Fieldtheory
Sourceen.wikipedia.org ↗

Listed 21 NP-complete problems (1972) — the taxonomy of hardness every programmer cites when giving up gracefully.

Proved 21 problems NP-complete (1972) — 'Reducibility Among Combinatorial Problems' — the paper that made NP-completeness the field's organizing question.\n\nTuring Award 1985; Edmonds–Karp is his flow algorithm.

Sources

  1. en.wikipedia.org/wiki/Richard_M._Karp
  2. en.wikipedia.org/wiki/Richard_Karp