Explore relationships

Sharp P

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.

Use + to expand a branch. Click a topic name to open its summary.