Sander Gribling

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On a Tracial Version of Haemers Bound IEEE Transactions on Information Theory	2024-03-14	Paper
A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation	2023-11-03	Paper
Approximate Pythagoras numbers on \(\ast\)-algebras over \(\mathbb{C}\) Journal of Complexity	2022-11-23	Paper
Bounding the separable rank via polynomial optimization Linear Algebra and its Applications	2022-06-01	Paper
Improved quantum lower and upper bounds for matrix scaling	2021-09-30	Paper
On the complexity of solving a decision problem with flow-depending costs: the case of the IJsselmeer dikes Discrete Optimization	2020-07-30	Paper
On the complexity of solving a decision problem with flow-depending costs: the case of the IJsselmeer dikes Discrete Optimization	2020-07-30	Paper
The Haemers bound of noncommutative graphs	2020-02-07	Paper
Lower bounds on matrix factorization ranks via noncommutative polynomial optimization Foundations of Computational Mathematics	2019-10-17	Paper
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization Mathematical Programming. Series A. Series B	2018-07-13	Paper
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization Mathematical Programming. Series A. Series B	2018-07-13	Paper
Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (available as arXiv preprint)	2017-08-04	Paper
Matrices with high completely positive semidefinite rank Linear Algebra and its Applications	2016-11-25	Paper

Research outcomes over time

This page was built for person: Sander Gribling