Combinatorics, complexity, and randomness

DOI10.1145/5657.5658zbMath0642.68004OpenAlexW2066649761WikidataQ56041413 ScholiaQ56041413MaRDI QIDQ3783491

Richard M. Karp

Publication date: 1986

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/5657.5658

zbMATH Keywords

computational complexitycombinatorial algorithmsTuring award winner

Mathematics Subject Classification ID

Development of contemporary mathematics (01A65) History of computer science (68-03)

Related Items (5)

Resolving Braess's paradox in random networks ⋮ Classifying the computational complexity of problems ⋮ An adaptive generic sorting algorithm that uses variable partitioning^∗ ⋮ Scheduling with neural networks -- the case of the Hubble Space Telescope ⋮ The 2004 Benjamin Franklin medal in computer and cognitive science presented to Richard M. Karp

This page was built for publication: Combinatorics, complexity, and randomness