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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Created claim: Wikidata QID (P12): Q127011891, #quickstatements; #temporary_batch_1721950759712
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Richard J. Gardner / rank
 
Normal rank
Property / author
 
Property / author: Peter Gritzmann / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary vectors partially determined by linear equation systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: X-rays characterizing some classes of discrete sets / 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: Reconstructing plane sets from projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reconstruction of binary patterns from their projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling contingency tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets uniquely determined by projections on axes. II: Discrete case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete Radon transform and its approximate inversion via linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete tomography: Determination of finite sets by X-rays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of pictures from their projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph Theoretic Approach to Statistical Data Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional Statistical Data Security Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for reconstructing convex bodies from their projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3754464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On projections of probability distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Switching components and the ambiguity problem in the reconstruction of pictures from their projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127011891 / rank
 
Normal rank

Latest revision as of 00:45, 26 July 2024

scientific article
Language Label Description Also known as
English
On the computational complexity of reconstructing lattice sets from their \(X\)-rays
scientific article

    Statements

    On the computational complexity of reconstructing lattice sets from their \(X\)-rays (English)
    0 references
    0 references
    0 references
    0 references
    29 November 1999
    0 references
    computational complexity
    0 references
    discrete tomography
    0 references

    Identifiers