NP-hardness of the stable matrix in unit interval family problem in discrete time

Systems and Control Letters

Volumn 42, Issue 4, 2001, Pages 261-265

  Mercado, Alejandra ^a   Ray Liu, K J ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Complexity; NP hardness

Indexed keywords

COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; PERTURBATION TECHNIQUES; POLYNOMIALS; SYSTEM STABILITY; THEOREM PROVING; VECTORS;

STABLE MATRIX;

DISCRETE TIME CONTROL SYSTEMS;

EID: 0034923155     PISSN: 01676911     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6911(00)00095-5     Document Type: Article

References (10)

1. NP-hardness of some linear control design problems
2. Stabilization of LTI systems with communications constraints
3. Limited communication control
4. Adaptive QoS for mobile multimedia applications using power control and smart antennas
5. Several NP-hard problems arising in robust stability analysis
6. Joint optimal power control and beamforming in wireless networks using antenna arrays