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 · 2026-04-16 14:20:57

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 16 Apr 2026 - 14:20

score 124 · Answer 2 · 2026-04-14 09:12:42

124

Views

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

Published on 14 Apr 2026 - 9:12

score 2k · Answer 3 · 2026-04-12 04:17:25

2k

Views

NP Solvable in Polynomial Time

Published on 12 Apr 2026 - 4:17

score 70 · Answer 4 · 2026-04-17 02:50:38

70

Views

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

Published on 17 Apr 2026 - 2:50

score 3.2k · Answer 5 · 2026-04-13 22:33:52

3.2k

Views

Knapsack problem NP-complete

Published on 13 Apr 2026 - 22:33

score 142 · Answer 6 · 2026-04-10 16:56:53

142

Views

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

Published on 10 Apr 2026 - 16:56

score 31.3k · Answer 7 · 2026-04-10 04:26:05

31.3k

Views

Understanding the reduction from Hamiltonian cycle to the traveling salesman problems

Published on 10 Apr 2026 - 4:26

score 230 · Answer 8 · 2026-04-13 17:21:07

230

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 13 Apr 2026 - 17:21

score 69 · Answer 9 · 2026-05-10 19:19:46

69

Views

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

Published on 10 May 2026 - 19:19

score 454 · Answer 10 · 2026-03-25 20:41:30

454

Views

Constructing a Travelling Salesman solution and problem

Published on 25 Mar 2026 - 20:41

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 144 · Answer 12 · 2026-03-26 01:02:42

144

Views

hamiltonian cycle in a directed simple graph

Published on 26 Mar 2026 - 1:02

score 116 · Answer 13 · 2026-03-25 20:41:05

116

Views

FP^NP[1] vs NP-complete

Published on 25 Mar 2026 - 20:41

score 229 · Answer 14 · 2026-03-25 20:35:41

229

Views

How to prove Shortest Common Superstring is NP-Hard

Published on 25 Mar 2026 - 20:35

score 30 · Answer 15 · 2026-03-25 22:06:22

30

Views

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

Published on 25 Mar 2026 - 22:06

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