``Strong'' NP-Completeness Results: Motivation, Examples, and Implications.

M. R. Garey, David S. Johnson: ``Strong'' NP-Completeness Results: Motivation, Examples, and Implications. J. ACM 25(3): 499-508(1978)

@article{DBLP:journals/jacm/GareyJ78,
  author    = {M. R. Garey and
               David S. Johnson},
  title     = {``Strong'' NP-Completeness Results: Motivation, Examples, and
               Implications},
  journal   = {J. ACM},
  volume    = {25},
  number    = {3},
  year      = {1978},
  pages     = {499-508},
  ee        = {db/journals/jacm/GareyJ78.html, http://doi.acm.org/10.1145/322077.322090},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Online Edition

Citation Page BibTeX

Referenced by

Shlomo Moran: On the Complexity of Designing Optimal Partial-Match Retrieval Systems. ACM Trans. Database Syst. 8(4): 543-551(1983)
Dorothy E. Denning, Peter J. Denning, Mayer D. Schwartz: The Tracker: A Threat to Statistical Database Security. ACM Trans. Database Syst. 4(1): 76-96(1979)

BibTeX