On the complexity of Jensen's algorithm for counting fixed polyominoes (Q2457308)

From MaRDI portal
Revision as of 12:10, 27 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of Jensen's algorithm for counting fixed polyominoes
scientific article

    Statements

    On the complexity of Jensen's algorithm for counting fixed polyominoes (English)
    0 references
    0 references
    0 references
    30 October 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    lattice animals
    0 references
    polyominoes
    0 references
    computational complexity
    0 references
    0 references