### np-complete

#### When NP complete becomes NP hard

Generally, assuming we have a NPC problem. Adding more constraint to it (making it more difficult), is it possible that problem become NPH? I know the difference between NPC and NPH but I don't know how to show that adding new constraints to existing NPC problem will make it NPH or still remains NPC?

Of course can an additional constraint transform an NPC to an NPH problem. Further there could be no person on World able to proof that.

### Related Links

Why using linear integer programming (ILP) though it is NP-Complete?

Prove NP-Completeness of generating 2 shortest routes over given edge grouping constraints?

Reduction to Clique prob

Approximation Algorithm between two NP compete problems

Is it possible to find the probability to a solution of NP-complete problems?

Knapsack for each weight having multiple values - Is it possible to solve?

Reduction from Maximum independent set to Dominating set to prove the Dominating set is NP-complete

How I can prove that 2-CNF is not NP-complete?

When NP complete becomes NP hard

Can it be proven no polynomial algorithm exists for an NP-Complete prob.?

Effect of number base when proving NP completeness of numerical problems

How to reduce 3COLOR to 3SAT?

proof NP-complete

Proof that Dominating Set is NP-Complete

Is this an NP problem?

Given a collection of consumers competing for a limited resource, allocate that resource to maximize it's applicability