Intermediate
Theory of Computation
Q58 / 100
What is the complexity class co-NP?
Correct! Well done.
Incorrect.
The correct answer is A) Problems whose complements are in NP
A
Correct Answer
Problems whose complements are in NP
Explanation
co-NP = {L̄ | L ∈ NP}: languages whose complement is in NP. If P = NP, then P = NP = co-NP. It is unknown if NP = co-NP. TAUTOLOGY is co-NP-complete.
Progress
58/100