Binary pattern tile set synthesis is NP-hard (Q527409)

From MaRDI portal
Revision as of 13:15, 29 April 2024 by EloiFerrer (talk | contribs) (‎Page on [mardi] deleted: Publication:527409)
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
    0 references
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references