PubMed · 11896237
Solution of a 20-variable 3-SAT problem on a DNA computer.
Abstract
A 20-variable instance of the NP-complete three-satisfiability (3-SAT) problem was solved on a simple DNA computer. The unique answer was found after an exhaustive search of more than 1 million (2(20)) possibilities. This computational problem may be the largest yet solved by nonelectronic means. Problems of this size appear to be beyond the normal range of unaided human computation.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ravinderjit S Braich, Nickolas Chelyapov, Cliff Johnson, Paul W K Rothemund, Leonard Adleman. 2002-03-14. Solution of a 20-variable 3-SAT problem on a DNA computer.. https://doi.org/10.1126/science.1069528
Cite the original work for its findings. Save a collection to share your selection of sources.