A polynomial-time DNA computing solution for the bin-packing problem (Q1039671)

From MaRDI portal
Revision as of 01:58, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A polynomial-time DNA computing solution for the bin-packing problem
scientific article

    Statements

    title
    A polynomial-time DNA computing solution for the bin-packing problem (English)
    0 references
    publication date
    23 November 2009
    0 references
    zbMATH Keywords
    DNA computing
    0 references
    bin-packing problem
    0 references
    parallel algorithm
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q05
    0 references
    68Q10
    0 references
    68W10
    0 references
    zbMATH DE Number
    5636967
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1039671&oldid=25946666"
    Powered by MediaWiki