Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms

Theoretical Computer Science

Volumn 259, Issue 1-2, 2001, Pages 81-98

  Chrobak, Marek ^a   Dürr, Christoph ^b  

^a University of California Riverside   (United States)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

Discrete tomography; High resolution transmission electron microscope; Multi commodity max flow

Indexed keywords

COMPUTERIZED TOMOGRAPHY; HIGH RESOLUTION ELECTRON MICROSCOPY; MOLECULAR STRUCTURE; THEOREM PROVING; TRANSMISSION ELECTRON MICROSCOPY;

POLYATOMIC STRUCTURES;

COMPUTATIONAL COMPLEXITY;

EID: 0034914386     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00325-4     Document Type: Article

References (10)

1. Matrices of zeros and ones with fixed row and column sum vectors
2. The reconstruction of binary patters from their projections
3. On the complexity of timetable and multicommodity flow problems
4. On the computational complexity of determining polyatomic structures by X-rays
5. Three-dimensional statistical data security problems
6. An approach to quantitate high-resolution transmission electron microscopy of crystalline materials
7. Mapping projected potential, interfacial roughness, and composition in general crystalline solids by quantitative transmission electron microscopy