1 votes 1 votes If there is in NP-Complete language L whose complement is in NP, then complement of any language in NP is in P NP both (A) and (B) None of these Theory of Computation nielit2016mar-scientistb theory-of-computation p-np-npc-nph + – admin asked Mar 31, 2020 retagged Oct 29, 2020 by Krithiga2101 admin 1.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes Since language L is NP-Complete all NP and NP Complete problems can be reduced to L in polynomial time. And it is given that complement of language L is in NP. Hence complement of all NP problems is in NP. ronak.ladhar answered Sep 18, 2020 ronak.ladhar comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes If there is an NP-complete language L whose complement is in NP, then the complement of any language in NP is in NP. Mohit Kumar 6 answered May 25, 2020 Mohit Kumar 6 comment Share Follow See all 0 reply Please log in or register to add a comment.