Richard M. Karp
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Computational Complexity in Theory and in Practice | Berkeley ACM A.M. Turing Laureate Colloquium 2018 | 2018-09-26 |
Survey of concrete claims and tools: Cook's reduction makes SAT the P vs NP focal point; NP-completeness follows by polynomial-time reductions. Industrial SAT… | ||
| nothing matches | ||