The NP-completeness column

Abstract

This is the 24th edition of a column that covers new developments in the theory of NP-completeness. The presentation is modeled on that which M. R. Garey and I used in our book &#8220;Computers and Intractability: A Guide to the Theory of NP-Completeness,&#8221; W. H. Freeman &amp; Co., New York, 1979, hereinafter referred to as &ldquo;&#8220;[G&amp;J].&rdquo;&#8221; Previous columns, the first 23 of which appeared in <i>J. Algorithms</i>, will be referred to by a combination of their sequence number and year of appearance, e.g. &#8220;[Col 1, 1981].&#8221; This edition of the column describes the history and purpose of the column and the status of the open problems from [G&amp;J] and previous columns.

DOI: 10.1145/1077464.1077476

Extracted Key Phrases

2 Figures and Tables

Statistics

051015'04'06'08'10'12'14'16
Citations per Year

66 Citations

Semantic Scholar estimates that this publication has 66 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Johnson2005TheNC, title={The NP-completeness column}, author={David S. Johnson}, journal={ACM Trans. Algorithms}, year={2005}, volume={1}, pages={160-176} }