Research Article
Solving the 0/1 Knapsack Problem by a Biomolecular DNA Computer
Input (), where contains or more memory strands with at least () bit regions. | For to , where is the total number of items | (a) Divide (, , ) | (b) Set (, ) | (c) Combine (, , ) | End for |
|