A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis (Q511695): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6687846 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
DNA pattern self-assembly | |||
| Property / zbMATH Keywords: DNA pattern self-assembly / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
tile complexity | |||
| Property / zbMATH Keywords: tile complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
manually-checkable proof | |||
| Property / zbMATH Keywords: manually-checkable proof / rank | |||
Normal rank | |||
Revision as of 02:58, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis |
scientific article |
Statements
A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis (English)
0 references
22 February 2017
0 references
DNA pattern self-assembly
0 references
tile complexity
0 references
manually-checkable proof
0 references
