Assume $P \neq NP$. Which of the following is not TRUE?
1.3-SAT is polynomial-time reducible to 2-SAT
means....all NP problems could be solved in polynomial time as(2-SAT is P) and it indicates P=NP
there it is false for N!= P.
:- But what is coNP in 2nd option any one please..???
@ankitgupta.1729 why A is true?
if $P \neq NP$ then 2SAT is P and not NP right?