A Caltech Library Service

Control problems and the polynomial time hierarchy

Tierno, Jorge E. and Doyle, John C. (1995) Control problems and the polynomial time hierarchy. In: Proceedings of 1995 34th IEEE Conference on Decision and Control. Vol.3. IEEE , Piscataway, NJ, pp. 2927-2931. ISBN 0-7803-2685-7.

[img] PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


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 II^p_2.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Doyle, John C.0000-0002-1828-2486
Additional Information:© 1995 IEEE. The authors are very grateful to Felipe Cucker for his assistance with the technical details of the Polynomial Time Hierarchy theory, and for explaining us the subtleties of the Blum Shub Smale computation model. This work was partially supported by NASA, NSF and AFOSR.
Funding AgencyGrant Number
Air Force Office of Scientific Research (AFOSR)UNSPECIFIED
Subject Keywords:complexity, stabilizability, polynomial hierarchy
Record Number:CaltechAUTHORS:20190319-100707731
Persistent URL:
Official Citation:J. E. Tierno and J. C. Doyle, "Control problems and the polynomial time hierarchy," Proceedings of 1995 34th IEEE Conference on Decision and Control, New Orleans, LA, USA, 1995, pp. 2927-2931 vol.3. doi: 10.1109/CDC.1995.478587
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:93958
Deposited By: Tony Diaz
Deposited On:19 Mar 2019 18:22
Last Modified:16 Nov 2021 17:01

Repository Staff Only: item control page