Jump to content

Template:Garey-Johnson

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Jonesey95 (talk | contribs) at 05:37, 22 February 2021 (Fix empty citation, unnamed or unsupported parameter, or invalid parameter value using AutoEd; see Help:CS1 errors). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Garey, Michael R.; Johnson, David S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, ISBN 0-7167-1045-5