PH
algorithmic complexity class; the union of all complexity classes in the polynomial hierarchy; the set of languages expressible by second-order logic
Facts
7 properties- Instance of
- complexity class
- Subclass of
- computational problem[3]
- Defining formula
- \mathrm{PH} = \bigcup_{k\in\mathbb{N}} \Delta_k^\mathrm{P}[6]
- Has part(s)
- Π2P[5]
- Has parts
- Π2P
- Named after
- polynomial hierarchy[2]
🏷️ Also known as
en PH
en Polynomial Hierarchy
es Jerarquia Polinomial
es Jerarquía Polinomial
fr Hiérarchie Polynomiale
fr Polynomial Hierarchy
pt Complexidade PH
ro clasa de complexitate PH
ru Класс PH
uk клас складності PH
uk поліноміальна ієрархія
zh PH (複雜度)
zh 多項式層次結構
🔖 Identifiers · 4
- OpenAlex ID
- C122806257
- BabelNet ID
- 03506650n
- Freebase ID
- /m/030dqt
- Microsoft Academic ID (discontinued)
- 122806257
🔗 Connections
Belongs to 1
Instance of 1
Maintained by WikiProject 1
Named after 1
Part of 1
Subclass of 1
Press Enter · cited answer in seconds
0 sources
Summary
PH is a complexity class[1].