List questions from np-complete

Published on 22 Mar 2026 - 4:31

596

Views

If a NP-complete problem is not in P, then all NP-complete problems are not in P?

Published on 09 Jul 2018 - 12:53

236

Views

Looking for name of combinatorial problem- Permute rows and columns to minimize distance to target matrix

Published on 24 Mar 2026 - 10:41

555

Views

Does this solve boolean satisfiability problem in polynomial time?

Published on 25 Mar 2026 - 1:13

418

Views

Properly stating a decision problem for a Hamiltonian cycle problem

Published on 23 Feb 2026 - 4:52

288

Views

How to prove a submodular maximization problem is NP-hard

Published on 05 Sep 2018 - 18:53

99

Views

GI-Completeness of graph isomorphism with connected graphs

Published on 07 Sep 2018 - 17:00

81

Views

Big-O for $\Sigma_{i = 1}^{N} i \times \binom{N}{i}$

Published on 08 Sep 2018 - 14:35

64

Views

Is the n-Queens problem only np-complete for the task of finding all setups or also for finding any solution?

Published on 14 Sep 2018 - 12:41

128

Views

Why is showing that ILP in NP not trivial

Published on 30 Sep 2018 - 18:19

61

Views

NP Completeness of a Graph Problem, Proof Required

Published on 01 Oct 2018 - 12:40

28

Views

NP-hardness proof of a model with a convex objective

Published on 05 Oct 2018 - 20:33

775

Views

Why can't set cover be reduced to min-cost max-flow?

Published on 10 Oct 2018 - 16:57

459

Views

Is the Maximum Clique Problem for Directed Acyclic Graphs NP complete as well?

Published on 22 Oct 2018 - 16:59

91

Views

Positioning items to maximize separation subject to constraints

Published on 23 Oct 2018 - 20:22

List Question

minimize system of infinity norm of polynomials

If a NP-complete problem is not in P, then all NP-complete problems are not in P?

Looking for name of combinatorial problem- Permute rows and columns to minimize distance to target matrix

Does this solve boolean satisfiability problem in polynomial time?

Properly stating a decision problem for a Hamiltonian cycle problem

How to prove a submodular maximization problem is NP-hard

GI-Completeness of graph isomorphism with connected graphs

Big-O for $\Sigma_{i = 1}^{N} i \times \binom{N}{i}$

Is the n-Queens problem only np-complete for the task of finding all setups or also for finding any solution?

Why is showing that ILP in NP not trivial

NP Completeness of a Graph Problem, Proof Required

NP-hardness proof of a model with a convex objective

Why can't set cover be reduced to min-cost max-flow?

Is the Maximum Clique Problem for Directed Acyclic Graphs NP complete as well?

Positioning items to maximize separation subject to constraints

Trending Questions

Popular # Hahtags

Popular Questions