List questions from np-complete

Published on 10 May 2026 - 20:53

132

Views

Knapsack problem on 2D or 3D space

Published on 25 Mar 2026 - 16:06

283

Views

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

Published on 10 May 2026 - 20:49

108

Views

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

Published on 26 Mar 2026 - 4:52

39

Views

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

Published on 26 Mar 2026 - 4:53

4.4k

Views

Feedback Vertex Set NP-complete proof

Published on 26 Mar 2026 - 3:10

22

Views

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

Published on 26 Mar 2026 - 3:13

29

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 26 Mar 2026 - 3:13

219

Views

Can you win the urn depletion game?

Published on 26 Mar 2026 - 4:52

391

Views

Link between all NP-complete problems

Published on 09 Apr 2026 - 13:30

146

Views

Optimizing list order to reduce total graph link distance

Published on 24 Apr 2026 - 14:44

63

Views

Convexity and NP-hardness

Published on 26 Mar 2026 - 6:20

83

Views

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

Published on 26 Mar 2026 - 4:53

133

Views

Equivalence of NP-complete problems

Published on 26 Mar 2026 - 6:20

83

Views

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

Published on 26 Mar 2026 - 4:51

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