Find link

language:

Find link is a tool written by Edward Betts.

searching for Computers and Intractability 35 found (101 total)

alternate case: computers and Intractability

Asymptotic computational complexity (303 words) [view diff] exact match in snippet view article find links to article

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: W. H. Freeman

Dodgson's method (344 words) [view diff] exact match in snippet view article find links to article

polynomial time. Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability. W.H. Freeman Co., San Francisco. ISBN 9780716710455. v t e

Monochromatic triangle (475 words) [view diff] exact match in snippet view article find links to article

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

K-edge-connected graph (928 words) [view diff] exact match in snippet view article find links to article

601. doi:10.1145/234533.234534. M.R. Garey and D.S. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco

Complete coloring (611 words) [view diff] exact match in snippet view article find links to article

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

Clique cover (935 words) [view diff] exact match in snippet view article find links to article

retrieved 2008-08-29 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

Minimum k-cut (831 words) [view diff] exact match in snippet view article find links to article

Computer Society, pp. 444–451 Garey, M. R.; Johnson, D. S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, ISBN 978-0-7167-1044-8

Polynomial-time reduction (1,462 words) [view diff] exact match in snippet view article find links to article

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

Odd cycle transversal (660 words) [view diff] exact match in snippet view article find links to article

David S. (1979), "GT21: Induced subgraph with property Π", Computers and Intractability: A Guide to the Theory of NP-completeness, W. H. Freeman, p. 195

Steiner travelling salesman problem (358 words) [view diff] exact match in snippet view article find links to article

1111/itor.12592. S2CID 71717255. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and

Nondeterministic Turing machine (1,662 words) [view diff] exact match in snippet view article find links to article

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

Vertex cycle cover (411 words) [view diff] case mismatch in snippet view article find links to article

edu/~avrim/451f13/recitation/rec1016.txt (problem 1) Garey and Johnson, Computers and intractability, GT13 Ben-Dor, Amir and Halevi, Shai. (1993). "Zero-one permanent

Weak NP-completeness (429 words) [view diff] exact match in snippet view article find links to article

input agents in unary coding. M. R. Garey and D. S. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness. W.H. Freeman, New

Correlation clustering (1,956 words) [view diff] exact match in snippet view article find links to article

Garey, M. and Johnson, D (W.H. Freeman and Company). (2000). Computers and Intractability: A Guide to the Theory of NP-Completeness.{{cite conference}}:

Boolean satisfiability problem (5,312 words) [view diff] exact match in snippet view article find links to article

listed as NP-complete problem "LO4" in the standard reference, Computers and Intractability: A Guide to the Theory of NP-Completeness by Michael R. Garey

Numerical 3-dimensional matching (675 words) [view diff] exact match in snippet view article find links to article

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

Induced path (1,486 words) [view diff] exact match in snippet view article find links to article

Combinatoria. 37: 191–208. Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman. p. 196

Quadratic programming (1,858 words) [view diff] exact match in snippet view article find links to article

MR 1150683. 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

Minimum relevant variables in linear system (1,042 words) [view diff] exact match in snippet view article find links to article

1016/S0304-3975(97)00115-1. Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman.

Multivariate cryptography (1,129 words) [view diff] case mismatch in snippet view article find links to article

competition: see slide 12 of the report. Garey, Michael R. (1979). Computers and intractability : a guide to the theory of NP-completeness. Johnson, David S

Talent scheduling (896 words) [view diff] exact match in snippet view article find links to article

ISSN 0304-3975. Garey, M. R.; Johnson, D. S. (1979). Victor Klee (ed.). Computers and Intractability: A Guide to the Theory of NP-Completeness. A Series of Books

NP (complexity) (2,740 words) [view diff] exact match in snippet view article

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

3-partition problem (2,212 words) [view diff] exact match in snippet view article find links to article

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

Modular arithmetic (3,879 words) [view diff] exact match in snippet view article find links to article

Retrieved 2020-11-11. Garey, M. R.; Johnson, D. S. (1979). Computers and Intractability, a Guide to the Theory of NP-Completeness. W. H. Freeman. ISBN 0716710447

Partition problem (2,456 words) [view diff] exact match in snippet view article find links to article

Partitioning (PDF). IJCAI. Garey, Michael; Johnson, David (1979). Computers and Intractability; A Guide to the Theory of NP-Completeness. pp. 96–105. ISBN 978-0-7167-1045-5

Graph partition (3,334 words) [view diff] case mismatch in snippet view article find links to article

Bibcode:2011arXiv1111.6745F. Garey, Michael R.; Johnson, David S. (1979). Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman & Co

Rainbow matching (2,561 words) [view diff] exact match in snippet view article find links to article

ISSN 0012-365X. Garey, M. R.; Johnson, D. S. (1979). Victor Klee (ed.). Computers and Intractability: A Guide to the Theory of NP-Completeness. A Series of Books

List of multiple discoveries (10,671 words) [view diff] case mismatch in snippet view article find links to article

Yorker, 5 October 2020, pp. 67–71. (p. 68.) See Garey & Johnson, Computers and intractability, p. 119. Cf. also the survey article by Trakhtenbrot (see "External

Quadratic residue (5,372 words) [view diff] exact match in snippet view article find links to article

ISBN 0-387-95097-4 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

Balanced number partitioning (3,168 words) [view diff] exact match in snippet view article find links to article

1002/jos.68. ISSN 1099-1425. Garey, Michael; Johnson, David (1979). Computers and Intractability; A Guide to the Theory of NP-Completeness. pp. 96–105. ISBN 978-0-7167-1045-5

Lateral computing (4,212 words) [view diff] exact match in snippet view article find links to article

edition, Prentice Hall Publishers. M. Garey and D. Johnson (1979); Computers and Intractability: A theory of NP Completeness, W.H. Freeman and Company Publishers

Travelling salesman problem (11,280 words) [view diff] exact match in snippet view article find links to article

Garey, Michael R.; Johnson, David S. (1979). "A2.3: ND22–24". Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman. pp

Complexity class (10,070 words) [view diff] exact match in snippet view article find links to article

how they fit together. Michael Garey, and David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman

Referring expression generation (4,156 words) [view diff] exact match in snippet view article find links to article

pages 42–49, Salt Fork, OH. M R Garey, D S. Johnson (1979). Computers and Intractability: A Guide to the Theory of NP–Completeness. W. H. Freeman, New

Multiway number partitioning (4,636 words) [view diff] exact match in snippet view article find links to article

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