The following pages link to (Q5434302):
Displaying 9 items.
- Reconstruction of convex polyominoes with a blocking component (Q265062) (← links)
- Reconstructing binary matrices with timetabling constraints (Q350725) (← links)
- Reconstruction of binary matrices under fixed size neighborhood constraints (Q952456) (← links)
- Reconstructing (0,1)-matrices from projections using integer programming (Q1001203) (← links)
- Tile-packing tomography is \(\mathbb{NP}\)-hard (Q1759658) (← links)
- Approximating Bicolored Images from Discrete Projections (Q3003545) (← links)
- Reconstructing a binary matrix under timetabling constraints (Q3439178) (← links)
- Reconstruction of binary matrices under adjacency constraints (Q3439193) (← links)
- Theoretical Computer Science (Q5395070) (← links)