Control problems and the polynomial time hierarchy
Jorge E. Tierno, John C. Doyle · 2002
Classifies control problems by exhibiting their alternating quantifier structure. This classification allows the authors to relate these control problems to the computational complexity classes of the polynomial time hierarchy. A specific synthesis problem for uncertain systems is shown to be hard in the class /spl Pi//sub 2//sup p/.