List questions from np-complete

Published on 25 Mar 2026 - 11:16

132

Views

Knapsack problem on 2D or 3D space

Published on 25 Mar 2026 - 16:06

282

Views

About satisfiability when we know that there is at most one solution.

Published on 26 Mar 2026 - 1:01

107

Views

P vs. NP: a proof by contradiction from an assumption

Published on 17 May 2020 - 16:46

38

Views

Is there < $2^n$ combinations of $length(S)/3$ when solving this special case of Exact Three Cover?

Published on 05 Jun 2020 - 16:54

4.4k

Views

Feedback Vertex Set NP-complete proof

Published on 07 Jun 2020 - 18:22

21

Views

Find the maximal Radius of a graph for any removal of a set of up to k vertices

Published on 17 Jun 2020 - 13:44

28

Views

Am I right that it takes $(\operatorname{length}(S)/3)/\operatorname{length}(C)$ odds of finding a solution for Exact Three Cover if one exists?

Published on 17 Jun 2020 - 23:01

218

Views

Can you win the urn depletion game?

Published on 20 Jun 2020 - 6:54

389

Views

Link between all NP-complete problems

Published on 23 Feb 2026 - 8:28

133

Views

Optimizing list order to reduce total graph link distance

Published on 25 Mar 2026 - 3:26

62

Views

Convexity and NP-hardness

Published on 09 Jul 2020 - 8:49

82

Views

Number of subsets $S \subset A_1 \cup A_2 \cup ... A_n$ where $|S \cap A_i| = a_i$?

Published on 14 Jul 2020 - 12:48

132

Views

Equivalence of NP-complete problems

Published on 16 Jul 2020 - 0:34

82

Views

Is knapSack 0-1 problem where weights equal to costs is also NP hard?

Published on 20 Jul 2020 - 13:21

List Question

CNF-SAT is NP-complete if and only if CNF-UNSAT is co-NP-complete?

Knapsack problem on 2D or 3D space

About satisfiability when we know that there is at most one solution.

P vs. NP: a proof by contradiction from an assumption

Is there < $2^n$ combinations of $length(S)/3$ when solving this special case of Exact Three Cover?

Feedback Vertex Set NP-complete proof

Find the maximal Radius of a graph for any removal of a set of up to k vertices

Am I right that it takes $(\operatorname{length}(S)/3)/\operatorname{length}(C)$ odds of finding a solution for Exact Three Cover if one exists?

Can you win the urn depletion game?

Link between all NP-complete problems

Optimizing list order to reduce total graph link distance

Convexity and NP-hardness

Number of subsets $S \subset A_1 \cup A_2 \cup ... A_n$ where $|S \cap A_i| = a_i$?

Equivalence of NP-complete problems

Is knapSack 0-1 problem where weights equal to costs is also NP hard?

Trending Questions

Popular # Hahtags

Popular Questions