The NP-completeness column: an ongoing guide

The NP-completeness column: an ongoing guide (1985)

by David S. Johnson

Venue:	Journal of Algorithms
Citations:	164 - 0 self

Datum	Value	Source
TITLE	The NP-completeness column: an ongoing guide	INFERENCE
AUTHOR NAME	David S. Johnson	SVM HeaderParse 0.2
AUTHOR AFFIL	; AT&T Bell Laboratories, Murray Hill	SVM HeaderParse 0.2
AUTHOR ADDR	; New Jersey 07974; send them to David S. Johnson	SVM HeaderParse 0.2
ABSTRACT	This is the nineteenth edition of a (usually) quarterly column that covers new developments in the theory of NP-completeness. The presentation is modeled on that used by M. R. Garey and myself in our book ‘‘Computers and Intractability: A Guide to the Theory of NP-Completeness,’ ’ W. H. Freeman & Co., New York, 1979 (hereinafter referred to as ‘‘[G&J]’’; previous columns will be referred to by their dates). A background equivalent to that provided by [G&J] is assumed, and, when appropriate, cross-references will be given to that book and the list of problems (NP-complete and harder) presented there. Readers who have results they would like mentioned (NP-hardness, PSPACE-hardness, polynomial-time-solvability, etc.) or open problems they would like publicized, should	SVM HeaderParse 0.2
YEAR	1985	INFERENCE
VENUE	Journal of Algorithms	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	434--451	INFERENCE
VOLUME	6	INFERENCE
CITATIONS	65 found	ParsCit 1.0