The polynomial hierarchy is a hierarchy of complexity classes that generalize NP and co-NP. It is defined using oracle machines or alternating Turing machines, and is a resource-bounded counterpart to the arithmetical and analytical hierarchies from mathematical logic. Its union is denoted PH, and it has complete problems related to quantified Boolean formulae.
Carnegie Mellon University
Spring 2023
This course provides an initial dive into complexity theory, exploring computations bound by resources like time, space, and energy. Emphasis is placed on low complexity classes.
No concepts data
+ 29 more concepts