Abstract
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 + n 3), 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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Supported by MEC through grant PB98-0937-C04 (FRESCO project)
Supported in part by the National Science Foundation Grants CCR-9701911, CCR-9725021 and INT-9726724.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Adleman. Molecular computation of solutions to combinatorial problems. Science, 266:1021–1024, 1994.
E. Bach, A. Condon, E. Glaser, and C. Tanguay. DNA models and algorithms for NP-complete problems. In Proceedings of 11th Conference on Computational Complexity, pages 290–299. IEEE Computer Society Press, Los Alamitos, CA, 1996.
W. Cai, A. Condon, R. Corn, E. Glaser, Z. Fei, T. Frutos, Z. Guo, M. Lagally, Q. Liu, L. Smith, and A. Thiel. The power of surface-based DNA computation. In Proceedings of 1st International Conference on Computational Molecular Biology, pages 67–74. ACM Press, 1997.
R. Lipton. DNA solutions of hard computational problems. Science, 268:542–545, 1995.
Q. Liu, L. Wang, A. G. Frutos, R. M. Corn, and L. M. Smith. DNA computing on surfaces. Nature, 403:175–178, 2000. January, 13.
M. Ogihara. Breadth first search 3SAT algorithms for DNA computers. Technical Report TR 629, Department of Computer Science, University of Rochester, Rochester, NY, July 1996.
M. Ogihara and A. Ray. DNA-based parallel computation by counting. In H. Rubin and D. H. Wood, editors, DNA Based Computers III, pages 255–264, 1997.
M. Ogihara and A. Ray. Biomolecular computing— recent theoretical and experimental advances. SIGACT News, 30(2):22–30, 1999.
M. Ogihara, A. Ray, and K. Smith. Biomolecular computing— a shape of computation to come. SIGACT News, 28(3):2–11, 1997.
J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the Association for Computing Machinery, 12(1):23–41, January 1965.
B. B. Rosenbaum, F. Oaks, S. Menchen, and B. Johnson. Improved single-stranded DNA sizing accuracy in capillary electrophoresis. Nucleic Acids Research, 25:3925–3929, 1997.
U. Schöning. A probabilistic algorithm for k-SAT and constraint satisfaction problems. In Proceedings of 40th Symposium on Foundations of Computer Science, pages 410–414. IEEE Computer Society Press, Los Alamitos, CA, 1999.
J. Sambrook, E. F. Fritsch, and T. Maniatis. Molecular Cloning: a Laboratory Manual. Cold Spring Harbor Press, NY, 2nd edition, 1989.
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
Díaz, S., Esteban, J.L., Ogihara, M. (2001). A DNA-based random walk method for solving 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_14
Download citation
DOI: https://doi.org/10.1007/3-540-44992-2_14
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