co-NP
complexity class
Press Enter · cited answer in seconds
0 sources
co-NP
Summary
co-NP is a complexity class[1]. co-NP draws 70 Wikipedia views per month (complexity_class category, ranking #12 of 61).[2]
Key Facts
- co-NP's instance of is recorded as complexity class[3].
- co-NP's subclass of is recorded as computational problem[4].
- co-NP's part of is recorded as Δ2P[5].
- co-NP's has part is recorded as co-NP-complete[6].
- co-NP's has part is recorded as P[7].
- co-NP's has part is recorded as DP[8].
- co-NP's Freebase ID is recorded as /m/01v72[9].
- co-NP's Microsoft Academic ID is recorded as 11786109[10].
Why It Matters
co-NP draws 70 Wikipedia views per month (complexity_class category, ranking #12 of 61).[2] co-NP has Wikipedia articles in 15 language editions, a strong signal of global cultural recognition.[11]