Bounding the separable rank via polynomial optimization

标题
Bounding the separable rank via polynomial optimization
作者
关键词
-
出版物
LINEAR ALGEBRA AND ITS APPLICATIONS
Volume 648, Issue -, Pages 1-55
出版商
Elsevier BV
发表日期
2022-04-22
DOI
10.1016/j.laa.2022.04.010

向作者/读者发起求助以获取更多资源

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now