Journal ArticleOPEN ACCESS

Combinatorics, complexity, and randomness

Communications of the ACM (1986) 29(2) 98-109
DOI: 10.1145/5657.5658
61Citations
Citations of this article
63Readers
Mendeley users who have this article in their library.

Abstract

The 1985 Turing Award winner presents his perspective on the development of the field that has come to be called theoretical computer science. © 1986, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Karp, R. M. (1986). Combinatorics, complexity, and randomness. Communications of the ACM, 29(2), 98–109. https://doi.org/10.1145/5657.5658

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free