Can I read The NP-completeness column: An ongoing guide on EtoBox?

The NP-completeness column: An ongoing guide by David S Johnson is a scholarly article available to read on EtoBox.

What is The NP-completeness column: An ongoing guide about?

This is the third edition of a quarterly column the purpose of which is to provide a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself inour book "Computers and Intractability: A Guide to the Theory of NP-Completeness," W. H. Freeman 8~ Co., San Francisco, 1979 (hereinafter referred to as -IG&JI~\*; previous columns will be referred to by their dates). A background equivalent to that provided by [G&J1 is assumed. Readers having results they would like mentioned (NP-hardness, PSPACE-hardness, polynomial-time-solvability, etc.), or open problems they would like publicixed, should send them to David S. Johnson, Room 2C-355, Bell Laboratories, Murray Hill, NJ 07974, including details, or at least sketches, of any new proofs (full papers are preferred). In the case of unpublished results, please state explicitly that you would like the results to be mentioned in the column. Comments and corrections are also welcome. For more details on the nature of the column and the form of desired submissions, see the December 1981 issue of this journal.

Author

David S Johnson

Publisher

Elsevier BV

Published

1982

Language

EN