| Literature DB >> 11896237 |
Ravinderjit S Braich1, Nickolas Chelyapov, Cliff Johnson, Paul W K Rothemund, Leonard Adleman.
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.Entities:
Mesh:
Substances:
Year: 2002 PMID: 11896237 DOI: 10.1126/science.1069528
Source DB: PubMed Journal: Science ISSN: 0036-8075 Impact factor: 47.728