Boolean hierarchy
Boolean hierarchy
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
- Beliefs and thought
- In collections
- Nobody has pulled it yet.
What Wikipedia says
The Boolean hierarchy is the hierarchy of Boolean combinations (intersection, union and complementation) of NP sets. Equivalently, the Boolean hierarchy can be described as the class of Boolean circuits over NP predicates. A collapse of the Boolean hierarchy would imply a collapse of the polynomial hierarchy.
Excerpt from the Wikipedia article “Boolean hierarchy”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Open free boosters and add Boolean hierarchy to your collection.
Play for free




