Login / Signup

Grassmannian optimization is NP-hard.

Zehua LaiLek-Heng LimKe Ye
Published in: CoRR (2024)
Keyphrases