Tile complexity of approximate squares (Q1949754)

From MaRDI portal
Revision as of 17:06, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Tile complexity of approximate squares
scientific article

    Statements

    title
    Tile complexity of approximate squares (English)
    0 references
    author
    Harish Chandran
    0 references
    Nikhil Gopalkrishnan
    0 references
    Q1058845
    0 references
    published in
    Algorithmica
    0 references
    publication date
    16 May 2013
    0 references
    Mathematics Subject Classification ID
    68W25
    0 references
    68Q25
    0 references
    92D20
    0 references
    zbMATH DE Number
    6163655
    0 references
    zbMATH Keywords
    self-assembly
    0 references
    tile assembly model
    0 references
    program size complexity
    0 references
    approximation algorithms
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1949754&oldid=14386600"
    Powered by MediaWiki