Binary pattern tile set synthesis is NP-hard (Q527409): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:26, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Binary pattern tile set synthesis is NP-hard |
scientific article |
Statements
Binary pattern tile set synthesis is NP-hard (English)
0 references
11 May 2017
0 references
algorithmic DNA self-assembly
0 references
pattern assembly
0 references
NP-hardness
0 references
computer-assisted proof
0 references
massively-parallelized program
0 references
