On the computational complexity of determining polyatomic structures by X-rays

Theoretical Computer Science

Volumn 233, Issue 1-2, 2000, Pages 91-106

  Gardner, R J ^a   Gritzmann, P ^b   Prangenberg, D ^c  

^a WESTERN WASHINGTON UNIVERSITY   (United States)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c UNIVERSITY OF TRIER   (Germany)

Author keywords

Computational complexity; Contingency table; Data security; Discrete tomography; Lattice; Polynomial time algorithm; Scheduling; Tomography; completeness

Indexed keywords

EID: 0346737904     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00298-3     Document Type: Article

References (15)

1. A. Blass, Y. Gurevich, On the unique satisfiability problem, Inform, and Control 55 (1982) 80-88.
2. S.-K. Chang, The reconstruction of binary patters from their projections, Comm. ACM 14 (1971)
3. Y.-C. Chen, A. Shastri, On joint realization of (0,1) matrices, Linear Algebra Appl. 112 (1989) 75-85.
4. P.C. Fishburn, J.C. Lagarias, J.A. Reeds, L.A. Shepp, Sets uniquely determined by projections on axes. II. Discrete case, Discrete Math. 91 (1991) 149-159.
5. Z. Galil, On some direct encodings of nondeterministic touring machines operating in polynomial time into P-complete problems, SIGACT News 6 (1) (1974) 19-24.
6. R.J. Gardner, P. Gritzmann, D. Prangenberg, On the computational complexity of reconstructing lattice sets from their X-rays, preprint.
7. R.J. Gardner, P. Gritzmann, D. Prangenberg, On the reconstruction of binary images from their discrete Radon transforms, in: R.A. Melter, A.Y. Wu, L. Latecki (eds.), Vision Geometry V, Society of PhotoOptical Instrumentation Engineers Proceedings, vol. 2826, 1996, pp. 121-132.
8. J.J. Gerbrands, C.H. Slump, A network flow approach to reconstruction of the left ventricle from two projections, Comput. Graphics Image Process. 18 (1982) 18-36.
9. R.W. Irving, M.R. Jerrum, Three-dimensional statistical data security problems, SIAM J. Comput. 23 (1994) 170-184.
10. R. Karp, Reducibility among combinational problems, in: R.E. Miller, J.W. Thatcher (eds.), Plenum Press, New York, 1972, pp. 85-103.
11. C. Kisielowski, P. Schwander, F.H. Baumann, M. Seibt, Y. Kim, A. Ourmazd, An approach to quantitative high-resolution transmission electron microscopy of crystalline materials, Ultramicroscopy 58 (1995) 131-155
12. C.H. Papadimitriou, M. Yannakakis, The complexity of facets (and some facets of complexity), J. Comput. System. Sci. 28 (1984) 244-259.
13. H.J. Ryser, Combinatorial Mathematics, Mathematical Association of America and Quinn & Boden, Rahway, NJ, 1963.
14. P. Schwander, C. Kisielowski, M. Seibt, F.H, Baumann, Y. Kim, A. Ourmazd, Mapping projected potential interfacial roughness, and composition in general crystalline solids by quantitative transmission electron microscopy, Phys. Rev. Lett. 71 (1993) 4150-4153.
15. J. Simon, On some central problems in computational complexity, Ph.D. thesis, Dept. of Computer Science, Cornell University, Ithaca, NY, 1975.