Computers and Intractability: A Guide to the Theory of NP-Completeness is a textbook by Michael Garey and David S. Johnson. It was the first book exclusively...
7 KB (779 words) - 04:28, 13 May 2025
Computational complexity theory (redirect from Computational intractability)
ISBN 978-0-471-34506-0 Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in...
50 KB (6,704 words) - 19:18, 26 May 2025
Bandersnatch (section Computer science)
problem in the academic theoretical computer science book by M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness...
18 KB (2,309 words) - 09:48, 3 May 2025
Garey and Johnson presented more than 300 NP-complete problems in their book Computers and Intractability: A Guide to the Theory of NP-Completeness, and new...
19 KB (2,354 words) - 04:22, 13 May 2025
Michael Garey (category American theoretical computer scientists)
computer science researcher, and co-author (with David S. Johnson) of Computers and Intractability: A Guide to the Theory of NP-completeness. He and Johnson...
2 KB (177 words) - 00:43, 18 March 2025
Subset sum problem (redirect from Schroeppel and Shamir's algorithm)
(2nd ed.). MIT Press and McGraw-Hill. ISBN 0-262-03293-7. Michael R. Garey and David S. Johnson (1979). Computers and Intractability: A Guide to the Theory...
25 KB (3,781 words) - 01:03, 19 June 2025
Hamiltonian path problem (category Hamiltonian paths and cycles)
R; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company. p. 60. Held, M.; Karp...
21 KB (2,518 words) - 19:02, 20 August 2024
David S. (1979), "[GT24] Balanced complete bipartite subgraph", Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, p. 196...
12 KB (960 words) - 08:06, 6 April 2025
Probabilistic Turing machine Garey, Michael R.; David S. Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman. ISBN 0-7167-1045-5...
12 KB (1,626 words) - 23:58, 16 March 2025
David S. Johnson (category American theoretical computer scientists)
Machinery in 1995, and as a member of the National Academy of Engineering in 2016. He was the coauthor of Computers and Intractability: A Guide to the Theory...
5 KB (270 words) - 00:43, 18 March 2025
Cover". MathWorld. 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...
4 KB (628 words) - 15:37, 15 June 2025
(1979), p. 117, 120. Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in...
2 KB (290 words) - 20:58, 8 May 2024
proportionality is not known precisely. Michael R. Garey and David S. Johnson (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H...
6 KB (614 words) - 10:20, 13 October 2024
ISBN 9783540210450. Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in...
9 KB (1,119 words) - 00:35, 28 April 2025
Bin packing problem (category Optimization algorithms and methods)
additional storage for holding the items to be rearranged. In Computers and Intractability: 226 Garey and Johnson list the bin packing problem under the reference...
53 KB (7,098 words) - 08:15, 17 June 2025
Log-space reduction (category Theoretical computer science stubs)
Press. pp. 125–146. Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman...
9 KB (1,358 words) - 19:50, 19 June 2025
Section 8.4: The Classes L and NL, pp. 294–296. ISBN 0-534-94728-X. Garey, M.R.; Johnson, D.S. (1979). Computers and Intractability: A Guide to the Theory...
12 KB (1,503 words) - 00:41, 16 June 2025
doi:10.1090/S0002-9947-1965-0170805-7. Michael Garey, and David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. New York:...
3 KB (309 words) - 10:30, 24 February 2025
and only if G has a chordal completion that respects the coloring. Although listed as an open problem in the 1979 book Computers and Intractability,...
11 KB (1,352 words) - 15:40, 3 February 2025
the treewidth. Garey, Michael R.; Johnson, David S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman,...
4 KB (481 words) - 08:23, 6 May 2024
Recognition: 149–159. Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in...
13 KB (1,637 words) - 19:43, 13 June 2025
ISBN 978-0-8186-0866-7. Garey, Michael R.; Johnson, D. S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman. Aho...
11 KB (1,472 words) - 23:39, 6 June 2023
ISBN 978-3-030-22628-2. Michael R. Garey and David S. Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H...
6 KB (773 words) - 00:22, 16 April 2025
Retrieved 13 Apr 2021. 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...
21 KB (2,784 words) - 09:34, 2 June 2025
P versus NP problem (redirect from P and NP)
ISBN 978-0-262-03293-3. Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in...
63 KB (7,784 words) - 06:53, 25 April 2025
S2CID 2303110. Garey, Michael R.; Johnson, David S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, ISBN 978-0-7167-1045-5...
15 KB (1,856 words) - 21:47, 15 June 2025
ISSN 0167-5060 Garey, Michael R.; Johnson, David S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, Series of Books in...
21 KB (3,016 words) - 11:35, 31 March 2025
Boolean satisfiability problem (category Logic in computer science)
of publication) Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman. pp...
52 KB (5,112 words) - 16:19, 16 June 2025
Multipartite graph (redirect from Tripartite graphs and networks)
supplied as part of the input. Garey, M. R.; Johnson, D. S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, GT4...
4 KB (399 words) - 15:28, 17 January 2025
Directed acyclic graph (section Reachability relation, transitive closure, and transitive reduction)
1016/0012-365X(73)90108-8. Garey, Michael R.; Johnson, David S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, Series of Books in...
45 KB (5,646 words) - 17:54, 7 June 2025