Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D (Q6076672)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D |
scientific article; zbMATH DE number 7741395
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D |
scientific article; zbMATH DE number 7741395 |
Statements
21 September 2023
0 references
self-assembly
0 references
algorithmic self-assembly
0 references
tile self-assembly
0 references
0.9366201758384703
0 references
0.8464005589485168
0 references
0.8439896106719971
0 references
0.8399417996406555
0 references
