Abstract
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(k 2 mn) 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 DNA algorithm to adapt techniques from the field of randomized classical algorithms.
This work was done while at the Department of Computer Science, Princeton University, Princeton, NJ 08544, USA.
This work was done while at the Department of Mathematics, Princeton University, Princeton, NJ 08544, USA.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D. Boneh, C. Dunworth, R. Lipton, and J. Sgall. On the computational power of DNA. Discrete Applied Mathematics: Special Issue on Computational Molecular Biology, 71:79–94, 1996.
M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394–397, 1962.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201–215, 1960.
R. Lipton. Using DNA to solve NP-complete problems. Science, 268:542–545, April 1995.
B. Monien and E. Speckenmeyer. Solving satisfiability in less than 2n steps. Discrete Applied Mathematics, 10:287–295, 1985.
M. Ogihara. Breadth first search 3-SAT algorithms for DNA computers. Technical Report TR 629, University of Rochester, Department of Computer Science, Rochester, NY, July 1996.
R. Paturi, P. Pudlák, M. Saks, and F. Zane. An improved exponential-time algorithm for k-SAT. In 39th Annual Symposium on Foundations of Computer Science, pages 628–637, Palo Alto, California, 8–11 Nov. 1998. IEEE.
R. Paturi, P. Pudlák, and F. Zane. Satisfiability coding lemma. In 38th Annual Symposium on Foundations of Computer Science, pages 566–574, Miami Beach, Florida, 20–22 Oct. 1997. IEEE.
H. Yoshida and A. Suyama. Solution to 3-SAT by breadth-first search. In E. Winfree and D. Gifford, editors, DNA Based Computers V, Cambridge, Massachusetts, 14–15 June 1999. American Mathematical Society.
F. Zane. Circuits, CNFs, and Satisfiability. PhD thesis, University of California at San Diego, Department of Computer Science and Engineering, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, K., Ramachandran, V. (2001). A space-efficient randomized DNA algorithm for k-SAT. In: Condon, A., Rozenberg, G. (eds) DNA Computing. DNA 2000. Lecture Notes in Computer Science, vol 2054. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44992-2_13
Download citation
DOI: https://doi.org/10.1007/3-540-44992-2_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42076-7
Online ISBN: 978-3-540-44992-8
eBook Packages: Springer Book Archive