I want to know how I can show that 2-CNF is not NP-hard or NP complete?
Asked
Active
Viewed 287 times
-1
-
If it can be done in a pre-determined number of steps then it is not NP-Hard, or NP-Complete. – Achrome Feb 20 '13 at 19:20
-
1Try cstheory.stackexchange.com, but show some effort first. – Wooble Feb 20 '13 at 19:23
1 Answers
2
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.
Falk Hüffner
- 4,942
- 19
- 25