Pages that link to "Item:Q2322885"
From MaRDI portal
The following pages link to On the polynomiality of finding \(^K\text{DMDGP}\) re-orders (Q2322885):
Displaying 10 items.
- On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data (Q1987024) (← links)
- A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances (Q2041974) (← links)
- A quantum approach to the discretizable molecular distance geometry problem (Q2101499) (← links)
- A note on the Cayley-Menger determinant and the molecular distance geometry problem (Q2127101) (← links)
- Unassigned distance geometry and molecular conformation problems (Q2131140) (← links)
- Distance geometry and data science (Q2192022) (← links)
- Comments on: ``Distance geometry and data science'' (Q2192023) (← links)
- NMR protein structure calculation and sphere intersections (Q2236703) (← links)
- On the optimality of finding DMDGP symmetries (Q2244000) (← links)
- Constraint programming approaches for the discretizable molecular distance geometry problem (Q6065908) (← links)
