The power of surface-based DNA computation (extended abstract)
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
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
Breadth First Search 3SAT Algorithms for DNA Computers
Breadth First Search 3SAT Algorithms for DNA Computers
Implementation of a Random Walk Method for Solving 3-SAT on Circular DNA Molecules
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
How Efficiently Can Room at the Bottom Be Traded Away for Speed at the Top?
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
A DNA-Based genetic algorithm implementation for graph coloring problem
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
| Hi-index | 0.00 |
This paper presents an implementation of a concurrent version of Schöning's algorithm for k-SAT in [Sch99]. It is shown that the algorithm can be implemented with space complexity O((2 - 2/k )n) and time complexity O(kmn + n3), where n is the number of variables and m the number of clauses. Besides, borrowing ideas from the above mentioned implementation, it is presented an implementation of resolution, a widely studied and used proof system, mainly in the fields of Proof Complexity and Automated Theorem Proving.