♯P

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, the complexity class #P (pronounced "sharp P" or, sometimes "number P" or "hash P") is the set of the counting problems associated with the decision problems in the set NP.

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

Image: Fschwarzentruber, CC BY-SA 4.0, via Wikimedia Commons.