Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization
Crossref DOI link: https://doi.org/10.1007/s10208-018-09410-y
Published Online: 2019-01-31
Published Print: 2019-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Gribling, Sander
de Laat, David
Laurent, Monique
Funding for this research was provided by:
Tilburg University
Text and Data Mining valid from 2019-01-31
Article History
Received: 4 September 2017
Revised: 31 May 2018
Accepted: 29 October 2018
First Online: 31 January 2019