A polynomial-time DNA computing solution for the bin-packing problem (Q1039671): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Molecular solution to the 0-1 knapsack problem based on DNA computing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A surface-based DNA algorithm for solving the binary knapsack problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4003964 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A DNA-based graph encoding scheme with its applications to graph isomorphism problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4737646 / rank | |||
Normal rank | |||
Latest revision as of 05:33, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time DNA computing solution for the bin-packing problem |
scientific article |
Statements
A polynomial-time DNA computing solution for the bin-packing problem (English)
0 references
23 November 2009
0 references
DNA computing
0 references
bin-packing problem
0 references
parallel algorithm
0 references
0 references
