in q4 in our last homework assignment , we were asked

to show NP=P with the help of a data about a language

L which is in NPC and also Co-NP.

Now , i am asking , why do we need that data?

cant we show NP=Co-NP with the same explanation

of P=Co-P ?

because NP can be **decided** in polynomial time with a Not deterministic machine.

So…. if we can decide L (which is in NP) during that time… we can also decide L-complete during the same time…by using the answer of L problem.

where is my mistake here? :-)

]]>