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 (220) 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.
- Publication:
-
Science
- Pub Date:
- April 2002
- DOI:
- 10.1126/science.1069528
- Bibcode:
- 2002Sci...296..499B
- Keywords:
-
- COMP/MATH