"An Efficient Greedy Algorithm for finding the Nearest Simultaneous ..."

Riku Akema, Masao Yamagishi, Isao Yamada (2018)

> Home

Details and statistics

DOI: 10.1109/SSP.2018.8450802

access: closed

type: Conference or Workshop Paper

metadata version: 2018-09-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ssp/AkemaYY18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ssp/AkemaYY18
Riku Akema, Masao Yamagishi, Isao Yamada:
An Efficient Greedy Algorithm for finding the Nearest Simultaneous Diagonalizable Family. SSP 2018: 771-775

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.