BabelNet

Search

bn:03506650n

Noun Named Entity

EL

No term available

EN

In computational complexity theory, the complexity class PH is the union of all complexity classes in the polynomial hierarchy: P H = ⋃ k ∈ N Δ k P {\displaystyle \mathrm {PH} =\bigcup _{k\in \mathbb {N} }\Delta _{k}^{\mathrm {P} }} PH was first defined by Larry Stockmeyer. Wikipedia

Relations

Sources

IS A

κλάση πολυπλοκότητας

υπολογιστικό πρόβλημα

PART OF

NAMED AFTER

πολυώνυμο ιεραρχία χρόνος