DNA Solution of Hard Computational Problems
- 28 April 1995
- journal article
- other
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 268 (5210), 542-545
- https://doi.org/10.1126/science.7725098
Abstract
DNA experiments are proposed to solve the famous "SAT" problem of computer science. This is a special case of a more general method that can solve NP-complete problems. The advantage of these results is the huge parallelism inherent in DNA-based computing. It has the potential to yield vast speedups over conventional electronic-based computers for such search problems.Keywords
This publication has 2 references indexed in Scilit:
- Molecular Computation of Solutions to Combinatorial ProblemsScience, 1994
- The Synthesis of Two-Terminal Switching CircuitsBell System Technical Journal, 1949