Publication | Closed Access
Michael R. ΠGarey and David S. Johnson. Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco1979, x + 338 pp.
106
Citations
0
References
1983
Year
Computational Complexity TheoryEngineeringComputational ComplexityFormal VerificationP Versus Np ProblemModel Of ComputationCombinatorial OptimizationDavid S. JohnsonSan Francisco1979Computer ScienceTheory Of ComputingMichael R. πGareyHumanitiesGet Access LinkAutomated ReasoningFormal MethodsMathematical FoundationsComputational ProblemComputability Theory
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.