An Improved Parallel DNA Algorithm of 3-SAT
There are many large-size and difficult computational problems in mathematics and computer science. For many of these problems, traditional computers cannot handle the mass of data in acceptable timeframes, which we call an NP problem. DNA computing is a means of solving a class of intractable compu...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ubiquity Press
2007-09-01
|
| Series: | Data Science Journal |
| Subjects: | |
| Online Access: | http://datascience.codata.org/articles/465 |