A DNA-based random walk method for solving k-SAT

Sergio Díaz, Juan Luis Esteban, Mitsunori Ogihara

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations

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 (Formula Presented) 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.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages209-220
Number of pages12
Volume2054
ISBN (Print)3540420762, 9783540420767
DOIs
StatePublished - 2001
Externally publishedYes
Event6th International Workshop on DNA-Based Computers, DNA 2000 - Leiden, Netherlands
Duration: Jun 13 2000Jun 17 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2054
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other6th International Workshop on DNA-Based Computers, DNA 2000
CountryNetherlands
CityLeiden
Period6/13/006/17/00

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'A DNA-based random walk method for solving k-SAT'. Together they form a unique fingerprint.

Cite this