Keywords
Completeness (order theory)Computer scienceCalculus (dental)Theoretical computer scienceProgramming languageMathematicsMedicine
Related Publications
Modal Logic
A textbook on modal logic, intended for readers already acquainted with the elements of formal logic, containing nearly 500 exercises. Brian F. Chellas provides a systematic int...
No Silver Bullet Essence and Accidents of Software Engineering
But, as we look to the horizon of a decade hence, we see no silver bullet. There is no single development, in either technology or in management technique, that by itself promis...
The Theory of the Estimation of Test Reliability
The theoretically best estimate of the reliability coefficient is stated in terms of a precise definition of the equivalence of two forms of a test. Various approximations to th...
Structure and Interpretation of Computer Programs
"The Structure and Interpretation of Computer Programs" is the entry-level subject in Computer Science at the Massachusetts Institute of Technology. It is required of all studen...
Sustainable data analysis with Snakemake
<ns4:p>Data analysis often entails a multitude of heterogeneous steps, from the application of various command line tools to the usage of scripting languages like R or Python fo...
Publication Info
- Year
- 1979
- Type
- book
- Citations
- 44422
- Access
- Closed
External Links
Citation Metrics
44422
OpenAlex
Cite This
M. R. Garey,
David S. Johnson
(1979).
Computers and Intractability: A Guide to the Theory of NP-Completeness.
.