24 research outputs found
Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
No full textSimulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
No full text
Reconstruction of Decomposable Discrete Sets from Four Projections
No full textIn this paper we introduce the class of decomposable discrete sets and give a polynomial algorithm for reconstructing discrete sets of this class from four projections. It is also shown that the class of decomposable discrete sets is more general than the class S ′ 8 of hv-convex 8-but not 4-connected discrete sets which was studied in [3]. As a consequence we also get that the reconstruction from four projections in S ′ 8 can be solved in O(mn) time
