Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes (Q3643099): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Latest revision as of 03: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
10 November 2009
0 references
self-assembling
0 references
tilings
0 references
time optimal construction
0 references
2D and 3D discrete geometry
0 references