NP-hardness of the stable matrix in unit interval family problem in discrete time |
| |
| Authors: | Alejandra Mercado K. J. Ray Liu |
| |
| Affiliation: | Electrical and Computer Engineering Department and Institute for Systems Research, University of Maryland, College Park, MD 20742, USA |
| |
| Abstract: | We show that to determine if a family of matrices, each with parameters in the unit interval, contains a matrix with all eigenvalues inside the unit circle is an NP-hard problem. We also discuss how this problem is closely related to the widespread problem of power control in wireless systems. |
| |
| Keywords: | Complexity NP-hardness |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
