The closure of P under complementation establishes coP ⊆ P, but does not establish that every problem in coP has a polynomial-time algorithm for its positive instances.
?Rate how convincing each reason is below to see the overall strength.
No one has weighed in yet. Be the first to share reasons for or against this statement.
Sign in or register to share your perspective on this statement.