P systems with active membranes: attacking NP-complete problems
Journal of Automata, Languages and Combinatorics
Handbook of Formal Languages
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Solution of a Satisfiability Problem on a Gel-Based DNA Computer
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Aqueous Solutions of Algorithmic Problems: Emphasizing Knights on a 3 x 3
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
A Proposal of DNA Computing on Beads with Application to SAT Problems
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA and membrane algorithms for SAT
Fundamenta Informaticae - Membrane computing
On the Logic and Geometry of Bilinear Forms
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Towards a robust biocomputing solution of intractable problems
DNA13'07 Proceedings of the 13th international conference on DNA computing
Algorithmic applications of XPCR
Natural Computing: an international journal
Autonomous resolution based on DNA strand displacement
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
On the scalability of biocomputing algorithms: The case of the maximum clique problem
Theoretical Computer Science
DNA'05 Proceedings of the 11th international conference on DNA Computing
DNA'04 Proceedings of the 10th international conference on DNA computing
On the Logic and Geometry of Bilinear Forms
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
DNA and Membrane Algorithms for SAT
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
| Hi-index | 0.00 |
A DNA algorithm for SAT, the satisfiability of propositional formulae, is presented where the number of separation steps is given by the number of clauses of the instance. This represents a computational improvement for DNA algorithms based on Adleman and Lipton's extraction model, where the number of separations equates the number of literals of the instance.