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):
Displaying 14 items.
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Efficient algorithms for network localization using cores of underlying graphs (Q742409) (← links)
- A maximum entropy approach to the realizability of spin correlation matrices (Q742783) (← 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)
- Phase retrieval of complex and vector-valued functions (Q2155281) (← links)
- A new graph parameter related to bounded rank positive semidefinite matrix completions (Q2248754) (← links)
- An efficient algorithm for maximum entropy extension of block-circulant covariance matrices (Q2435387) (← links)
- Positive semidefinite matrix completion, universal rigidity and the strong Arnold property (Q2451678) (← links)
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming (Q2566758) (← links)
- Euclidean Distance Matrices and Applications (Q2802549) (← links)
- Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Q2848995) (← links)
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices (Q5258947) (← links)
