Combinatorics, complexity, and randomness

DOI10.1145/5657.5658MaRDI QIDQ3783491zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Richard 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

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

Cited in

(7)

• Resolving Braess's paradox in random networks
• The Combinatorics of Non-determinism
• The 2004 Benjamin Franklin medal in computer and cognitive science presented to Richard M. Karp
• Extending the bicriterion approach for anticlustering: exact and hybrid approaches
• An adaptive generic sorting algorithm that uses variable partitioning^∗
• Classifying the computational complexity of problems
• Scheduling with neural networks -- the case of the Hubble Space Telescope

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783491)