"An Entropy-Based Bound for the Computational Complexity of a Switched System."

Benoît Legat, Pablo A. Parrilo, Raphaël M. Jungers (2019)

> Home

Details and statistics

DOI: 10.1109/TAC.2019.2902625

access: closed

type: Journal Article

metadata version: 2020-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tac/LegatPJ19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tac/LegatPJ19
Benoît Legat, Pablo A. Parrilo, Raphaël M. Jungers:
An Entropy-Based Bound for the Computational Complexity of a Switched System. IEEE Trans. Autom. Control. 64(11): 4623-4628 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.