Pages that link to "Item:Q1810881"
From MaRDI portal
The following pages link to Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems (Q1810881):
Displayed 10 items.
- Least-squares approximations in geometric buildup for solving distance geometry problems (Q637550) (← links)
- Discretization orders for distance geometry problems (Q691496) (← links)
- The discretizable molecular distance geometry problem (Q694593) (← links)
- Rigid versus unique determination of protein structures with geometric buildup (Q941022) (← links)
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation (Q1048270) (← links)
- Recent advances on the interval distance geometry problem (Q1683318) (← links)
- The discretizable distance geometry problem (Q1926615) (← links)
- Phase retrieval of complex and vector-valued functions (Q2155281) (← links)
- A Euclidean distance matrix model for protein molecular conformation (Q2307747) (← links)
- Approximating the problem, not the solution: an alternative view of point set matching (Q2369583) (← links)