Pages that link to "Item:Q2576888"
From MaRDI portal
The following pages link to Some necessary clarifications about the chords' problem and the partial digest problem (Q2576888):
Displaying 9 items.
- Homometry and direct-sum decompositions of lattice-convex sets (Q306515) (← links)
- On the reconstruction of planar lattice-convex sets from the covariogram (Q443900) (← links)
- The simplified partial digest problem: approximation and a graph-theoretic model (Q621677) (← links)
- On the approximability of the simplified partial digest problem (Q967421) (← links)
- On the complexity of constructing Golomb rulers (Q1028469) (← links)
- The minimum distance superset problem: formulations and algorithms (Q1756748) (← links)
- A new dynamic programming algorithm for the simplified partial digest problem (Q2697542) (← links)
- COVARIOGRAM OF NON‐CONVEX SETS (Q3584591) (← links)
- String Reconstruction from Substring Compositions (Q5502098) (← links)
