Binary pattern tile set synthesis is NP-hard (Q527409): Difference between revisions
From MaRDI portal
Latest revision as of 18:39, 13 July 2024
scientific article; zbMATH DE number 6498710
- Binary Pattern Tile Set Synthesis Is NP-hard
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Binary pattern tile set synthesis is NP-hard |
scientific article; zbMATH DE number 6498710 |
|
Statements
Binary pattern tile set synthesis is NP-hard (English)
0 references
Binary Pattern Tile Set Synthesis Is NP-hard (English)
0 references
11 May 2017
0 references
27 October 2015
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
0 references
0 references
0 references
