List questions from np-complete

Published on 12 Aug 2017 - 11:34

183

Views

Prove that each language in $NP$ has both properties with respect to polynomial reductions.

Published on 13 Aug 2017 - 19:46

262

Views

2-in-3-SAT vs. Gaussian elimination

Published on 26 Mar 2026 - 19:37

410

Views

Is there any kind of connection between the Axiom of Choice and the $\rm P = NP$ problem?

Published on 30 Aug 2017 - 9:29

46

Views

Is this problem of selecting points NP-hard?

Published on 11 Sep 2017 - 15:09

240

Views

Knapsack Optimization Problem

Published on 13 Sep 2017 - 18:36

433

Views

NP Hardness of Diagonal Language.

Published on 15 Sep 2017 - 21:03

30

Views

How to get the maximal fully related subset of a partially related set?

Published on 23 Sep 2017 - 12:01

277

Views

Is Multiple Integration Over Random Variables NP HARD

Published on 27 Sep 2017 - 23:27

71

Views

Partition a tree with weighted edges into two disjoint subsets with same cardinality to maximize cut weight

Published on 26 Mar 2026 - 19:01

55

Views

Is this associated cost set problem NP-hard?

Published on 08 Oct 2017 - 23:05

114

Views

Is this NP complete?

Published on 27 Mar 2026 - 13:31

2.7k

Views

Reducing Subset-Sum to Scheduling with start time.

Published on 03 Nov 2017 - 15:22

3.8k

Views

Reduce Independent Set to Path Selection problem?

Published on 09 Nov 2017 - 1:36

236

Views

Show that problem is solvable in polynomial time.

Published on 27 Mar 2026 - 9:37

List Question

Show that checking if word contains subword which doesn't contain patterns is NP-complete

Prove that each language in $NP$ has both properties with respect to polynomial reductions.

2-in-3-SAT vs. Gaussian elimination

Is there any kind of connection between the Axiom of Choice and the $\rm P = NP$ problem?

Is this problem of selecting points NP-hard?

Knapsack Optimization Problem

NP Hardness of Diagonal Language.

How to get the maximal fully related subset of a partially related set?

Is Multiple Integration Over Random Variables NP HARD

Partition a tree with weighted edges into two disjoint subsets with same cardinality to maximize cut weight

Is this associated cost set problem NP-hard?

Is this NP complete?

Reducing Subset-Sum to Scheduling with start time.

Reduce Independent Set to Path Selection problem?

Show that problem is solvable in polynomial time.

Trending Questions

Popular # Hahtags

Popular Questions