| 摘要 |
The present invention overcomes problems in prior art DNA-based computing methods for solving non-deterministic polynomial optimization problems, by providing methods that derive the most probable answers in a statistically significant manner that makes the methods scalable with increases in the number of data inputs, and thus makes the methods practical.
|
