Pages that link to "Item:Q1575953"
From MaRDI portal
The following pages link to On the computational complexity of determining polyatomic structures by X-rays (Q1575953):
Displaying 12 items.
- Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem (Q617894) (← links)
- A reconstruction algorithm for a subclass of instances of the 2-color problem (Q638558) (← links)
- On tiling under tomographic constraints. (Q1401222) (← links)
- Tile-packing tomography is \(\mathbb{NP}\)-hard (Q1759658) (← links)
- Algorithms for linear time reconstruction by discrete tomography. II (Q2028077) (← links)
- On polyatomic tomography over abelian groups: some remarks on consistency, tree packings and complexity (Q2197684) (← links)
- Regular switching components (Q2422036) (← links)
- A formulation of the wide partition conjecture using the atom problem in discrete tomography (Q2440106) (← links)
- Using graphs for some discrete tomography problems (Q2581557) (← links)
- Solving the Two Color Problem: An Heuristic Algorithm (Q3003544) (← links)
- Approximating Bicolored Images from Discrete Projections (Q3003545) (← links)
- Error Correction for Discrete Tomography (Q6094519) (← links)
