Tile complexity of approximate squares (Q1949754)

From MaRDI portal
Revision as of 11:17, 6 July 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
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
    John H. Reif
    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
    OpenAlex ID
    W2018891418
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1949754&oldid=35332938"
    Powered by MediaWiki