The following pages link to Sander Gribling (Q344890):
Displaying 9 items.
- Matrices with high completely positive semidefinite rank (Q344893) (← links)
- (Q783031) (redirect page) (← links)
- On the complexity of solving a decision problem with flow-depending costs: the case of the IJsselmeer dikes (Q783034) (← links)
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization (Q1650765) (← links)
- Approximate Pythagoras numbers on \(\ast\)-algebras over \(\mathbb{C}\) (Q2099276) (← links)
- Bounding the separable rank via polynomial optimization (Q2144234) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- On a Tracial Version of Haemers Bound (Q6195694) (← links)
- Improved quantum lower and upper bounds for matrix scaling (Q6379075) (← links)