PubMed · 7725098
DNA solution of hard computational problems.
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
R J Lipton. 1995-04-28. DNA solution of hard computational problems.. https://doi.org/10.1126/science.7725098
Cite the original work for its findings. Save a collection to share your selection of sources.