List questions from np-complete

Published on 30 Sep 2014 - 8:53

185

Views

Non-Deterministic Polynomial Time Algorithm

Published on 01 Oct 2014 - 15:13

409

Views

P and NP and NP-complete and NP-hard in simple terms

Published on 08 Oct 2014 - 9:32

241

Views

Is there a problem more difficult than NP-complete in graph theory?

Published on 01 Nov 2014 - 22:50

706

Views

Proof of why the partition function Z in probabilistic graphical models (PGM) is NP-complete

Published on 09 Nov 2014 - 4:33

2.2k

Views

Is knowing the size of a minimum vertex cover equivalent to finding a minimal cover?

Published on 13 Nov 2014 - 0:38

1.4k

Views

Using up letters on a refrigerator is NP-complete

Published on 14 Nov 2014 - 2:52

288

Views

How do you load $n$ cannisters into $m$ trucks such that no truck is overloaded

Published on 14 Nov 2014 - 6:23

1.7k

Views

How can we show that 3-dimensional matching $\le_p$ exact cover?

Published on 16 Nov 2014 - 23:15

434

Views

Complexity of Subset-Sum when the target sum is a constant

Published on 18 Nov 2014 - 22:19

101

Views

Transportation mininum cost problem

Published on 19 Nov 2014 - 20:57

8.6k

Views

Reduction of 3-SAT to 3-COLOR

Published on 21 Nov 2014 - 15:26

156

Views

Efficiency of a max-min problem for $\sum_{j=1}^m |b_j-a_j|$ with $a_i$, $b_j$ restricted to convex sets

Published on 01 Dec 2014 - 19:19

1.3k

Views

3-COLOR Decision Problem

Published on 01 Dec 2014 - 22:09

702

Views

Is a subset of a NP-complete language also NP-complete?

Published on 25 Mar 2026 - 16:02

List Question

Minimizing sum of products

Non-Deterministic Polynomial Time Algorithm

P and NP and NP-complete and NP-hard in simple terms

Is there a problem more difficult than NP-complete in graph theory?

Proof of why the partition function Z in probabilistic graphical models (PGM) is NP-complete

Is knowing the size of a minimum vertex cover equivalent to finding a minimal cover?

Using up letters on a refrigerator is NP-complete

How do you load $n$ cannisters into $m$ trucks such that no truck is overloaded

How can we show that 3-dimensional matching $\le_p$ exact cover?

Complexity of Subset-Sum when the target sum is a constant

Transportation mininum cost problem

Reduction of 3-SAT to 3-COLOR

Efficiency of a max-min problem for $\sum_{j=1}^m |b_j-a_j|$ with $a_i$, $b_j$ restricted to convex sets

3-COLOR Decision Problem

Is a subset of a NP-complete language also NP-complete?

Trending Questions

Popular # Hahtags

Popular Questions