Pages that link to "Item:Q2706294"
From MaRDI portal
The following pages link to Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems (Q2706294):
Displayed 5 items.
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Completion problem with partial correlation vines (Q852640) (← links)
- On the uniqueness of Euclidean distance matrix completions. (Q1405021) (← links)
- On the uniqueness of Euclidean distance matrix completions: the case of points in general position (Q1774976) (← links)
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming (Q2566758) (← links)