Jisho

×
PH (計算複雑性理論)
Links
Wikipedia definition
1. PH (complexity)​In computational complexity theory, the complexity class PH is the union of all complexity classes in the polynomial hierarchy: PH was first defined by Larry Stockmeyer. It is a special case of hierarchy of bounded alternating Turing machine. It is contained in P = P (by Toda's theorem; the class of problems that are decidable by a polynomial time Turing machine with access to a #P or equivalently PP oracle), and also in PSPACE.
Read “PH (complexity)” on English Wikipedia
Read “PH (計算複雑性理論)” on Japanese Wikipedia
Read “PH (complexity)” on DBpedia

Discussions

to talk about this word.