A Probabilistic 3-SAT Algorithm Further Improved
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
A Space-Efficient Randomized DNA Algorithm for k-SAT
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
A DNA-Based Random Walk Method for Solving k-SAT
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
DNA models and algorithms for NP-complete problems
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
In a DNA computation a select operation is used to separate DNA molecules with different sequences. The implementation of the select operation requires specialized hardware and non-standard modification of DNA molecules by adding e.g., magnetic beads to a primer sequence or using other methods to separate DNA in solution. In this paper we consider DNA computations which use enzymatic reactions and secondary structure formation to perform computations. We show that it is possible to implement an efficient (exponential-time) probabilistic algorithm to solve instances of the satisfiability problem on circular single stranded DNA.