The NP-completeness column: an ongoing guide (1985)
Cached
Download Links
- [www.research.att.com]
- [public.research.att.com]
- [www.research.att.com]
- [www.research.att.com]
- [www.research.att.com]
- [public.research.att.com]
- [www.research.att.com]
- [www.research.att.com]
- [www.research.att.com]
- [www.research.att.com]
- [public.research.att.com]
- [www.research.att.com]
- [www.research.att.com]
- [www.research.att.com]
- [www.research.att.com]
- [www.research.att.com]
- [www.research.att.com]
- [www.research.att.com]
- [www.research.att.com]
- [www.research.att.com]
- DBLP
Other Repositories/Bibliography
| Venue: | Journal of Algorithms |
| Citations: | 164 - 0 self |
BibTeX
@ARTICLE{Johnson85thenp-completeness,
author = {David S. Johnson},
title = {The NP-completeness column: an ongoing guide},
journal = {Journal of Algorithms},
year = {1985},
volume = {6},
pages = {434--451}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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
