Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes (Q3643099): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-03076-5_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2264541619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Running time and program size for self-assembled squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The program-size complexity of self-assembled squares (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:19, 2 July 2024

scientific article
Language Label Description Also known as
English
Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes
scientific article

    Statements

    Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    self-assembling
    0 references
    tilings
    0 references
    time optimal construction
    0 references
    2D and 3D discrete geometry
    0 references
    0 references