Solution of a 20-variable 3-SAT problem on a DNA computer
- PMID: 11896237
- DOI: 10.1126/science.1069528
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.
Comment in
-
Computing. Successes and challenges.Science. 2002 Apr 19;296(5567):478-9. doi: 10.1126/science.1070978. Science. 2002. PMID: 11964464 No abstract available.
Publication types
MeSH terms
Substances
LinkOut - more resources
Full Text Sources
Other Literature Sources
Research Materials
Miscellaneous
