Journal
SCIENCE
Volume 296, Issue 5567, Pages 499-502Publisher
AMER ASSOC ADVANCEMENT SCIENCE
DOI: 10.1126/science.1069528
Keywords
-
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
