A polynomial-time DNA computing solution for the bin-packing problem (Q1039671): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.amc.2009.07.051
+Normal rank
@@ Property / OpenAlex ID @@
+W2083141139
@@ Property / OpenAlex ID: W2083141139 / rank @@
+Normal rank
@@ Property / cites work @@
+Molecular solution to the 0-1 knapsack problem based on DNA computing
+Normal rank
@@ Property / cites work @@
+A surface-based DNA algorithm for solving the binary knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4003964
@@ Property / cites work: Q4003964 / rank @@
+Normal rank
@@ Property / cites work @@
+A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers
+Normal rank
@@ Property / cites work @@
+A DNA-based graph encoding scheme with its applications to graph isomorphism problems
+Normal rank
@@ Property / cites work @@
+Q4737646
@@ Property / cites work: Q4737646 / rank @@
+Normal rank