article

Free access

Combinatorics, complexity, and randomness

Author:

Richard M. KarpAuthors Info & Claims

Communications of the ACM, Volume 29, Issue 2

Pages 98 - 109

https://doi.org/10.1145/5657.5658

Published: 01 February 1986 Publication History

PDF eReader

Abstract

The 1985 Turing Award winner presents his perspective on the development of the field that has come to be called theoretical computer science.

Cited By

View all

Gonzalez M(2024)The Algorithm of BeautyA Companion to Literary Evaluation10.1002/9781119409908.ch7(120-134)Online publication date: 22-Mar-2024
https://doi.org/10.1002/9781119409908.ch7
Lee GKim JChoi MJang RLee R(2023)Review of Code Similarity and Plagiarism Detection Research StudiesApplied Sciences10.3390/app13201135813:20(11358)Online publication date: 16-Oct-2023
https://doi.org/10.3390/app132011358
Zhang MXin YWang LJajodia SSinghal A(2019)CASFinder: Detecting Common Attack SurfaceData and Applications Security and Privacy XXXIII10.1007/978-3-030-22479-0_18(338-358)Online publication date: 15-Jul-2019
https://dl.acm.org/doi/10.1007/978-3-030-22479-0_18
Show More Cited By

Recommendations

Combinatorics, complexity, and randomness
ACM Turing award lectures
Rethinking Randomness: An interview with Jeff Buzen, Part II

In Part 1, Jeff Buzen discussed the basic principles of his new approach to randomness, which is the topic of his book Rethinking Randomness. He continues here with a more detailed discussion of models that have been used successfully to predict the ...
Rethinking Randomness: An interview with Jeff Buzen, Part I

For more than 40 years, Jeffrey Buzen has been a leader in performance prediction of computer systems and networks. His first major contribution was an algorithm, known now as Buzen's Algorithm, that calculated the throughput and response time of any ...

Reviews

Reviewer: S. Srinivasan

This is the ACM 1985 Turing Award Lecture paper. In this expository paper, the author traces the history of the work in the area of computational complexity. The chart on the development of combinatorial optimization and computational complexity very succinctly presents all the major developments from 1900 to the current time. The author has outlined the work of various people, such as M. Held, L. Ford, and S. Cook. By its very nature, the paper does not get into any technical details. However, the account of work done in the area of the Traveling Salesman problem and other NP-complete problems is very enlightening. The account of the work on linear programming problems and application of probability techniques to simplex algorithms is fairly detailed. This paper has no bibliography. Nonetheless, the paper should appeal to a very wide audience.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 29, Issue 2

Feb. 1986

68 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/5657

Editor:
Peter J. Denning

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1986

Published in CACM Volume 29, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

56
Total Citations
View Citations
3,313
Total Downloads

Downloads (Last 12 months)145
Downloads (Last 6 weeks)15

Reflects downloads up to 01 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gonzalez M(2024)The Algorithm of BeautyA Companion to Literary Evaluation10.1002/9781119409908.ch7(120-134)Online publication date: 22-Mar-2024
https://doi.org/10.1002/9781119409908.ch7
Lee GKim JChoi MJang RLee R(2023)Review of Code Similarity and Plagiarism Detection Research StudiesApplied Sciences10.3390/app13201135813:20(11358)Online publication date: 16-Oct-2023
https://doi.org/10.3390/app132011358
Zhang MXin YWang LJajodia SSinghal A(2019)CASFinder: Detecting Common Attack SurfaceData and Applications Security and Privacy XXXIII10.1007/978-3-030-22479-0_18(338-358)Online publication date: 15-Jul-2019
https://dl.acm.org/doi/10.1007/978-3-030-22479-0_18
Fotakis DKaporis ALianeas TSpirakis P(2017)Resolving Braess's Paradox in Random NetworksAlgorithmica10.1007/s00453-016-0175-278:3(788-818)Online publication date: 1-Jul-2017
https://dl.acm.org/doi/10.1007/s00453-016-0175-2
Stockmeyer L(2014)Classifying the computational complexity of problemsThe Journal of Symbolic Logic10.2307/227385852:1(1-43)Online publication date: 12-Mar-2014
https://doi.org/10.2307/2273858
Tedre M(2014)Empirical Computer ScienceThe Science of Computing10.1201/b17764-17(187-214)Online publication date: 3-Dec-2014
https://doi.org/10.1201/b17764-17
Tao FLaili YLiu YFeng YWang QZhang LXu L(2014)Concept, Principle and Application of Dynamic Configuration for Intelligent AlgorithmsIEEE Systems Journal10.1109/JSYST.2013.22756198:1(28-42)Online publication date: Mar-2014
https://doi.org/10.1109/JSYST.2013.2275619
Fortnow LHomer S(2014)Computational ComplexityComputational Logic10.1016/B978-0-444-51624-4.50011-3(495-521)Online publication date: 2014
https://doi.org/10.1016/B978-0-444-51624-4.50011-3
Tao FLaili YZhang LTao FZhang LLaili Y(2014)Brief History and Overview of Intelligent Optimization AlgorithmsConfigurable Intelligent Optimization Algorithm10.1007/978-3-319-08840-2_1(3-33)Online publication date: 19-Aug-2014
https://doi.org/10.1007/978-3-319-08840-2_1
Bickmore D(2013)Scientific Roles for the New CartographyThe Cartographic Journal10.1179/caj.1987.24.1.5624:1(56-58)Online publication date: 18-Jul-2013
https://doi.org/10.1179/caj.1987.24.1.56
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations