Binary pattern tile set synthesis is NP-hard (Q527409): Difference between revisions
From MaRDI portal
Changed an Item |
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
||
| description / en | description / en | ||
Revision as of 14:14, 29 April 2024
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Binary pattern tile set synthesis is NP-hard |
No description defined |
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
