All mock tests are FREE till 31 December — register to save your progress

Consider the complexity class as the ¯¯¯ L ∈ NP set of languages L such that , and the following two statements :

S : P ⊆ CO − NP 1 S NP ≠ CO − NP P ≠ NP

2 : If , then Which of the following is/are correct? S

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: C. Both 1 and 2 S S

Explanation

P is closed under complement, so P ⊆ co-NP. If P = NP then NP = co-NP, so NP ≠ co-NP implies P ≠ NP.

More Data Structures and Algorithms questions