"Grassmannian optimization is NP-hard."

Zehua Lai, Lek-Heng Lim, Ke Ye (2024)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2406.19377

access: open

type: Informal or Other Publication

metadata version: 2024-07-24

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2406-19377
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2406-19377
Zehua Lai, Lek-Heng Lim, Ke Ye:
Grassmannian optimization is NP-hard. CoRR abs/2406.19377 (2024)

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.