The following pages link to On Ranks of Regular Polygons (Q4594484):
Displaying 7 items.
- Algorithms for positive semidefinite factorization (Q1790680) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- (Q2960999) (← links)
- The Phaseless Rank of a Matrix (Q5157584) (← links)
- Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization (Q5742692) (← links)
- Complex psd-minimal polytopes in dimensions two and three (Q6089230) (← links)
- Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations (Q6592116) (← links)