The 2004 Benjamin Franklin medal in computer and cognitive science presented to Richard M. Karp
From MaRDI portal
Publication:2571820
DOI10.1016/j.jfranklin.2005.04.009zbMath1078.01538OpenAlexW2022819494MaRDI QIDQ2571820
Publication date: 14 November 2005
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jfranklin.2005.04.009
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing a perfect matching is in random NC
- Time bounded random access machines
- Combinatorics, complexity, and randomness
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- On the Computational Complexity of Algorithms
- Paths, Trees, and Flowers
- The complexity of theorem-proving procedures
- On Computable Numbers, with an Application to the Entscheidungsproblem
