• DocumentCode
    490379
  • Title

    The Computational Complexity of Approximation Algorithms for Robust Stability in Rank-Two Matrix Polytopes

  • Author

    Coxson, Gregory E. ; DeMarco, Christopher L.

  • Author_Institution
    Department of Electrical and Computer Engineering, UW-Madison, 1415 Johnson Drive, Madison, WI 53706. coxson@apollo.ece.wisc.edu
  • fYear
    1993
  • fDate
    2-4 June 1993
  • Firstpage
    1671
  • Lastpage
    1672
  • Keywords
    Approximation algorithms; Books; Computational complexity; Drives; Eigenvalues and eigenfunctions; Instruction sets; Robust stability; Tellurium; Testing; Veins;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    American Control Conference, 1993
  • Conference_Location
    San Francisco, CA, USA
  • Print_ISBN
    0-7803-0860-3
  • Type

    conf

  • Filename
    4793158
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=490379