PH (complexity)

If you find our videos helpful you can support us by buying something from amazon. https://www.amazon.com/?tag=wiki-audio-20 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. -Video is targeted to blind users Attribution: Article text available under CC-BY-SA image source in video https://www.youtube.com/watch?v=T5FelAUmDq0