Published December 1995
| Published
Book Section - Chapter
Open
Control problems and the polynomial time hierarchy
- Creators
- Tierno, Jorge E.
-
Doyle, John C.
Abstract
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.
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.Attached Files
Published - 00478587.pdf
Files
00478587.pdf
Files
(486.2 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:d1026953c8b0d968fe9d446a3224a709
|
486.2 kB | Preview Download |
Additional details
- Eprint ID
- 93958
- Resolver ID
- CaltechAUTHORS:20190319-100707731
- NASA
- NSF
- Air Force Office of Scientific Research (AFOSR)
- Created
-
2019-03-19Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field