Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Book
%1 garey1979computers
%A Garey, M. R.
%A Johnson, D. S.
%D 1979
%I W. H. Freeman
%K complexity computer np science tcs theoretical
%T Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
%U http://www.amazon.com/Computers-Intractability-NP-Completeness-Mathematical-Sciences/dp/0716710455
%7 First Edition
%@ 0716710455
@book{garey1979computers,
added-at = {2011-09-01T15:03:14.000+0200},
asin = {0716710455},
author = {Garey, M. R. and Johnson, D. S.},
biburl = {https://www.bibsonomy.org/bibtex/2fac25cd952418baa739dd35243b3dbdc/folke},
description = {Amazon.com: Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) (9780716710455): M. R. Garey, D. S. Johnson: Books},
dewey = {519.4},
ean = {9780716710455},
edition = {First Edition},
interhash = {ff69422a0dd852de42ed1c7d63fb2bf6},
intrahash = {fac25cd952418baa739dd35243b3dbdc},
isbn = {0716710455},
keywords = {complexity computer np science tcs theoretical},
publisher = {W. H. Freeman},
timestamp = {2011-09-01T15:03:14.000+0200},
title = {Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)},
url = {http://www.amazon.com/Computers-Intractability-NP-Completeness-Mathematical-Sciences/dp/0716710455},
year = 1979
}
