Tile-packing tomography is \(\mathbb{NP}\)-hard (Q1759658): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-011-9498-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071695456 / rank
 
Normal rank

Revision as of 03:06, 20 March 2024

scientific article
Language Label Description Also known as
English
Tile-packing tomography is \(\mathbb{NP}\)-hard
scientific article

    Statements

    Tile-packing tomography is \(\mathbb{NP}\)-hard (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    tilings
    0 references
    discrete tomography
    0 references
    \(\mathbb{NP}\)-hardness
    0 references
    affine independence
    0 references
    0 references