ZPPZPP
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, ZPP (zero-error probabilistic polynomial time) is the complexity class of problems for which a probabilistic Turing machine exists with these properties:
Excerpt from the Wikipedia article “ZPP (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 ZPP to your collection.
Play for free

