Login / Signup

On the NP-Hardness of Checking Matrix Polytope Stability and Continuous-Time Switching Stability.

Leonid GurvitsAlexander Olshevsky
Published in: IEEE Trans. Autom. Control. (2009)
Keyphrases
  • np hardness
  • np hard
  • markov chain
  • worst case analysis
  • learning algorithm
  • high dimensional
  • evolutionary algorithm
  • state space
  • scheduling problem