A Space-Efficient Randomized DNA Algorithm for k-SAT

@inproceedings{Chen2000ASR,
  title={A Space-Efficient Randomized DNA Algorithm for k-SAT},
  author={Kevin Chen and Vijay Ramachandran},
  booktitle={DNA Computing},
  year={2000}
}
We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds a satisfying assignment, assuming one exists, with probability 1−e−α, in worst-case time O(kmn) and space O(2(1− 1 k )n+log ). This makes it the most space-efficient DNA k-SAT algorithm for k > 3 and k < n/ logα (i.e. the clause size is small compared to the number of variables). In addition, our algorithm is the first… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 10 extracted citations

An 0(1.414n) volume molecular solution for the 0–1 knapsack problem on DNA-based supercomputing

2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) • 2010
View 2 Excerpts

Molecular Computation and Evolutionary Wetware: A Cutting-Edge Technology for Artificial Life and Nanobiotechnologies

IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) • 2007
View 2 Excerpts

A MEMS Based DNA Computer for Solving SAT Problems

2006 1st IEEE International Conference on Nano/Micro Engineered and Molecular Systems • 2006
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Using DNA to Solve NP-Complete ProblemsRichard

J...., LiptonyPrinceton, UniversityPrinceton
1995
View 8 Excerpts
Highly Influenced

Satisfiability Coding Lemma

View 8 Excerpts
Highly Influenced

Circuits, CNFs, and Satisfiability

F. Zane
PhD thesis, University of California at San Diego, Department of Computer Science and Engineering, • 1998
View 2 Excerpts

Similar Papers

Loading similar papers…