Reducibility among combinatorial problems. Karp, R. M. In Complexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972), pages 85–103, 1972. Plenum, New York.
bibtex   
@inproceedings {Karp1972Reducibility,
    AUTHOR = {Karp, Richard M.},
     TITLE = {Reducibility among combinatorial problems},
 BOOKTITLE = {Complexity of computer computations ({P}roc. {S}ympos., {IBM}
              {T}homas {J}. {W}atson {R}es. {C}enter, {Y}orktown {H}eights,
              {N}.{Y}., 1972)},
     PAGES = {85--103},
 PUBLISHER = {Plenum, New York},
      YEAR = {1972},
   MRCLASS = {68A20},
  MRNUMBER = {0378476},
MRREVIEWER = {John T. Gill},
}

Downloads: 0