Co-NP

Co-NP

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

In computational complexity theory, co-NP is a complexity class. A decision problem X is a member of co-NP if and only if its complement X is in the complexity class NP.

Excerpt from the Wikipedia article “Co-NP”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Co-NP to your collection.

Play for free

Related cards