Question

Proof NP-Complete for $L = \{G, T \mid G \text{ is a graph with a spanning tree isomorphic to } T\}$

score 2.5k · Answer 1 · 2014-12-10 22:32:19

2.5k

Views

Proof NP-Complete for $L = \{G, T \mid G \text{ is a graph with a spanning tree isomorphic to } T\}$

Published on 10 Dec 2014 - 22:32

score 121 · Answer 2 · 2014-12-14 18:38:26

121

Views

A language $L$ is polynomially transformable to $L_0$

Published on 14 Dec 2014 - 18:38

score 2k · Answer 3 · 2014-12-15 04:55:02

2k

Views

NP Solvable in Polynomial Time

Published on 15 Dec 2014 - 4:55

score 68 · Answer 4 · 2014-12-18 10:06:40

68

Views

Questions concerning assumptions to conclude that $\operatorname{P}=\operatorname{NP}$

Published on 18 Dec 2014 - 10:06

score 3.2k · Answer 5 · 2014-12-19 19:33:35

3.2k

Views

Knapsack problem NP-complete

Published on 19 Dec 2014 - 19:33

score 139 · Answer 6 · 2014-12-22 08:04:52

139

Views

What is a simple proof that something is np complete that does not use np completeness of something else?

Published on 22 Dec 2014 - 8:04

score 31.3k · Answer 7 · 2014-12-22 09:32:25

31.3k

Views

Understanding the reduction from Hamiltonian cycle to the traveling salesman problems

Published on 22 Dec 2014 - 9:32

score 227 · Answer 8 · 2014-12-27 17:28:38

227

Views

Find an assignment of courses to days so that no student has more than one exam on the same day is NP-complete?

Published on 27 Dec 2014 - 17:28

score 66 · Answer 9 · 2026-02-23 06:38:03

66

Views

Any NP-Hard problem is reducible to other NP-Hard

Published on 23 Feb 2026 - 6:38

score 453 · Answer 10 · 2019-11-10 04:10:08

453

Views

Constructing a Travelling Salesman solution and problem

Published on 10 Nov 2019 - 4:10

score 47 · Answer 11 · 2026-03-25 19:01:11

47

Views

Learning Bayesian Networks is NP-Complete (Chickering Proof)

Published on 25 Mar 2026 - 19:01

score 143 · Answer 12 · 2019-11-26 16:26:23

143

Views

hamiltonian cycle in a directed simple graph

Published on 26 Nov 2019 - 16:26

score 115 · Answer 13 · 2019-12-06 23:20:54

115

Views

FP^NP[1] vs NP-complete

Published on 06 Dec 2019 - 23:20

score 228 · Answer 14 · 2019-12-15 00:29:54

228

Views

How to prove Shortest Common Superstring is NP-Hard

Published on 15 Dec 2019 - 0:29

score 29 · Answer 15 · 2019-12-16 14:04:48

29

Views

Cover all 'weighted' points by the smallest set of ranges: is this still a Set Cover problem?

Published on 16 Dec 2019 - 14:04

List Question

Proof NP-Complete for $L = \{G, T \mid G \text{ is a graph with a spanning tree isomorphic to } T\}$

A language $L$ is polynomially transformable to $L_0$

NP Solvable in Polynomial Time

Questions concerning assumptions to conclude that $\operatorname{P}=\operatorname{NP}$

Knapsack problem NP-complete

What is a simple proof that something is np complete that does not use np completeness of something else?

Understanding the reduction from Hamiltonian cycle to the traveling salesman problems

Find an assignment of courses to days so that no student has more than one exam on the same day is NP-complete?

Any NP-Hard problem is reducible to other NP-Hard

Constructing a Travelling Salesman solution and problem

Learning Bayesian Networks is NP-Complete (Chickering Proof)

hamiltonian cycle in a directed simple graph

FP^NP[1] vs NP-complete

How to prove Shortest Common Superstring is NP-Hard

Cover all 'weighted' points by the smallest set of ranges: is this still a Set Cover problem?

Trending Questions

Popular # Hahtags

Popular Questions