On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays (Q5955125): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing convex polyominoes from horizontal and vertical projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices of zeros and ones with fixed row and column sum vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the reconstruction of binary and permutation matrices under (binary) tomographic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing \(hv\)-convex polyominoes from orthogonal projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of reconstructing lattice sets from their \(X\)-rays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Binary Images from Discrete X-Rays / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algorithmic inversion of the discrete Radon transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional Statistical Data Security Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Properties of Matrices of Zeros and Ones / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:43, 3 June 2024

scientific article; zbMATH DE number 1703195
Language Label Description Also known as
English
On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays
scientific article; zbMATH DE number 1703195

    Statements

    On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays (English)
    0 references
    7 February 2002
    0 references
    computational complexity
    0 references
    NP-hardness
    0 references
    discrete tomography problem
    0 references
    reconstruction
    0 references
    greedy algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references