1337holiday
Reputation
387
Next privilege 500 Rep.
Access review queues
 Jan 8 awarded Popular Question Nov 20 awarded Autobiographer Oct 25 awarded Popular Question Oct 23 awarded Notable Question Oct 7 awarded Popular Question Oct 1 awarded Popular Question Jul 7 awarded Popular Question Feb 14 awarded Notable Question Dec 19 awarded Constituent Dec 8 awarded Caucus Nov 17 awarded Popular Question Sep 8 awarded Popular Question Jul 2 awarded Curious Apr 8 comment If $P=NP$, prove that $L' \in NP$ Yes thats exactly what i was thinking, the definition we use is that if the language can be verified in polynomial time then its in NP. Since $L'$ has a verifier $V$ then its in $NP$. I guess thats the answer, just thought I was missing something. Apr 8 revised If $P=NP$, prove that $L' \in NP$ deleted 123 characters in body Apr 8 comment If $P=NP$, prove that $L' \in NP$ @ShreevatsaR I've edited it a bit to include more of the original question but yes this is why I am confused myself, I don't know what exactly this question is asking. Apr 8 revised If $P=NP$, prove that $L' \in NP$ added 42 characters in body Apr 8 comment If $P=NP$, prove that $L' \in NP$ Yes I believe so since it was stated that $L \in NP$. Apr 8 asked If $P=NP$, prove that $L' \in NP$ Apr 7 accepted Prove language is in $NP$ without using a reduction