coNP
Description: coNP is a computational complexity class containing decision problems whose complements can be verified in polynomial time.
Primary topic: Complexity and Algorithms in Graphs (38%)
Related topic: Complexity and Algorithms in Graphs (38%)
Wikidata ID: wiki/Q955748
OpenAlex ID: keywords/conp
