Binary pattern tile set synthesis is NP-hard (Q527409)
From MaRDI portal
(Redirected from Item:Q3448857)
| 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: Binary pattern tile set synthesis is NP-hard |
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
0.9999999
0 references
0.86007655
0 references
0 references
0.83056307
0 references
0.82716846
0 references
0.81848806
0 references
0.8180901
0 references
0 references