The following pages link to Extremal correlation matrices (Q915822):
Displaying 23 items.
- An update on a few permanent conjectures (Q309252) (← links)
- A note on extremal decompositions of covariances (Q309479) (← links)
- The real positive semidefinite completion problem for series-parallel graphs (Q676039) (← links)
- Special classes of positive and completely positive maps (Q677813) (← links)
- A note on infinite extreme correlation matrices (Q924323) (← links)
- Positive semidefinite quadratic forms on unitary matrices (Q972792) (← links)
- On some convex sets and their extreme points (Q1318083) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- A connection between positive semidefinite and Euclidean distance matrix completion problems (Q1381268) (← links)
- Null spaces of correlation matrices (Q1399237) (← links)
- On extremal correlations (Q1600720) (← links)
- Completely positive semidefinite rank (Q1785204) (← links)
- On a positive semidefinite relaxation of the cut polytope (Q1894508) (← links)
- Some geometric results in semidefinite programming (Q1905963) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
- An analytic approach to a permanent conjecture (Q1940312) (← links)
- Determinantal sampling designs (Q2317241) (← links)
- Compatible matrices of Spearman's rank correlation (Q2322625) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Q2848995) (← links)
- Binary Representation of Normalized Symmetric and Correlation Matrices (Q4822843) (← links)
- Self-dual maps and symmetric bistochastic matrices (Q4908158) (← links)
- Correlation matrices, Clifford algebras, and completely positive semidefinite rank (Q5145555) (← links)
