Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes (Q2945667)

From MaRDI portal
Revision as of 19:56, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes
scientific article

    Statements

    Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes (English)
    0 references
    0 references
    0 references
    14 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    art gallery problem
    0 references
    polyomino
    0 references
    \(r\)-visibility
    0 references
    NP-hardness
    0 references
    0 references