### np-complete

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

I want to know how I can show that 2-CNF is not NP-hard or NP complete? Can anyone help me in this regard. I need the solution urgently.

2-CNF satisfiability is known to be in P. So if you were able to prove it is not NP-complete, it would follow that P ≠ NP. Thus, no one knows how to prove this.

### Related Links

Grid dominating set is NP-complete

Given a graph with n vertices and m edges, does it contain a simple cycle of length ⌈n/2⌉?

NP-complete or NP-hard?

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