[go: up one dir, main page]
Jump to content

Search results

The page "9780716710455" does not exist. You can create a draft and submit it for review or request that a redirect be created, but consider checking the search results below to see whether the topic is already covered.

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Thumbnail for NP-hardness
    NP-hardness
    NP-Completeness. Series of Books in the Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676....
    8 KB (1,082 words) - 12:35, 14 October 2024
  • Thumbnail for Graph isomorphism
    Graph isomorphism
    NP-Completeness. Series of Books in the Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676....
    13 KB (1,643 words) - 10:53, 25 October 2024
  • Thumbnail for NP-completeness
    NP-completeness
    Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676. This book is a classic, developing the...
    30 KB (3,617 words) - 17:49, 12 November 2024
  • Cook–Levin theorem
    NP-Completeness. Series of Books in the Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676....
    19 KB (2,355 words) - 22:12, 5 November 2024
  • Thumbnail for Directed acyclic graph
    Directed acyclic graph
    Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676., Problems GT7 and GT8, pp. 191–192. Harary...
    45 KB (5,626 words) - 19:17, 2 November 2024
  • NP-easy
    NP-Completeness. Series of Books in the Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676.....
    2 KB (290 words) - 20:58, 8 May 2024
  • List of NP-complete problems
    Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676.. This book is a classic, developing the...
    29 KB (2,746 words) - 10:59, 2 November 2024
  • P versus NP problem
    Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676. Goldreich, Oded (2010). P, NP, and NP-Completeness...
    63 KB (7,782 words) - 18:22, 10 November 2024
  • Computational complexity
    Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676. Goldreich, Oded (2008), Computational Complexity:...
    20 KB (2,989 words) - 05:12, 11 October 2024
  • Subset sum problem
    Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676., Section 3.1 and problem SP1 in Appendix A...
    25 KB (3,792 words) - 14:10, 26 June 2024
  • Thumbnail for Minimum spanning tree
    Minimum spanning tree
    Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676.. ND12 Gabow, Harold N. (1977), "Two algorithms...
    44 KB (5,460 words) - 21:16, 9 October 2024
  • Thumbnail for Dodgson's method
    Dodgson's method
    polynomial time. Garey, Michael R.; Johnson, David S. (1979). Computers and Intractability. W.H. Freeman Co., San Francisco. ISBN 9780716710455. v t e...
    3 KB (344 words) - 16:46, 21 October 2024
  • Thumbnail for Steiner tree problem
    Steiner tree problem
    Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676., pp. 208–209, problems ND12 and ND13. Hwang...
    35 KB (4,388 words) - 13:27, 12 August 2024
  • Computational complexity theory
    Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676. Goldreich, Oded (2008), Computational Complexity:...
    49 KB (6,717 words) - 21:56, 25 September 2024
  • NP-equivalent
    NP-Completeness. Series of Books in the Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676.....
    3 KB (450 words) - 11:55, 11 January 2023
  • Thumbnail for Dominating set
    Dominating set
    Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676., p. 190, problem GT2. Hedetniemi, S. T...
    31 KB (4,082 words) - 10:23, 13 October 2024
  • Thumbnail for 3-dimensional matching
    3-dimensional matching
    Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676., Section 3.1 and problem SP1 in Appendix A...
    13 KB (1,551 words) - 10:22, 13 October 2024
  • Domatic number
    Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676.. A1.1: GT3, p. 190. Cockayne, E. J.; Hedetniemi...
    6 KB (973 words) - 21:59, 18 September 2021
  • Chordal completion
    Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676., [OPEN4], p. 286; update, p. 339. Yannakakis...
    11 KB (1,352 words) - 23:05, 18 August 2023
  • Thumbnail for Bipartite half
    Bipartite half
    Mathematical Sciences (1st ed.). New York: W. H. Freeman and Company. ISBN 9780716710455. MR 0519066. OCLC 247570676., Problem GT59. Chen, Zhi-Zhong; Grigni...
    4 KB (493 words) - 20:25, 28 July 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
Retrieved from "https://en.wikipedia.org/wiki/Special:Search"