PPPP
complexity
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 complexity theory, PP, or PPT is the class of decision problems solvable by a probabilistic Turing machine in polynomial time with an error probability of less than 1/2 for all instances. The abbreviation PP refers to probabilistic polynomial time. The complexity class was defined by Gill in 1977.
Excerpt from the Wikipedia article “PP (complexity)”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Image: Bilorv, CC0, via Wikimedia Commons.
Open free boosters and add PP to your collection.
Play for free

