Skip to main content
Conference Proceedings

NP-completeness: A retrospective

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1256 3-6
DOI: 10.1007/3-540-63165-8_160
36Citations
Citations of this article
54Readers
Mendeley users who have this article in their library.
Get full text

Abstract

For a quarter of a century now, NP-completeness has been computer science's favorite paradigm, fad, punching bag, buzzword, alibi, and intellectual export. This paper is a fragmentary commentary on its origins, its nature, its impact, and on the attributes that have made it so pervasive and contagious.

Cite

CITATION STYLE

APA

Papadimitriou, C. H. (1997). NP-completeness: A retrospective. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1256, pp. 3–6). Springer Verlag. https://doi.org/10.1007/3-540-63165-8_160

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