Overview of Complexity and Decidability Results for Three Classes of Elementary Nonlinear Systems
Cached
Download Links
- [anxiety-closet.mit.edu]
- [www.inma.ucl.ac.be]
- [www.mit.edu]
- [www.inma.ucl.ac.be]
- [www.ulg.ac.be]
- DBLP
Other Repositories/Bibliography
by
Vincent D. Blondel
,
John N. Tsitsiklis
| Citations: | 6 - 6 self |
BibTeX
@MISC{Blondel_overviewof,
author = {Vincent D. Blondel and John N. Tsitsiklis},
title = {Overview of Complexity and Decidability Results for Three Classes of Elementary Nonlinear Systems },
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
It has become increasingly apparent this last decade that many problems in systems and control are NP-hard and, in some cases, undecidable. The inherent complexity of some of the most elementary problems in systems and control points to the necessity of using alternative approximate techniques to deal with problems that are unsolvable or intractable when exact solutions are sought. We survey
