Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms

Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

Abstract

We give a deterministic algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its upper bound on the worst-case running time matches the best known upper bound for randomized satisfiability-testing algorithms [6]. In comparison with the randomized algorithm in [6], our deterministic algorithm is simpler and more intuitive.

Original languageEnglish
Title of host publicationAlgorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings
Pages60-68
Number of pages9
DOIs
StatePublished - 2006
Externally publishedYes
Event6th Italian Conference on Algorithms and Complexity, CIAC 2006 - Rome, Italy
Duration: 29 May 200631 May 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3998 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th Italian Conference on Algorithms and Complexity, CIAC 2006
Country/TerritoryItaly
CityRome
Period29/05/0631/05/06

Fingerprint

Dive into the research topics of 'Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms'. Together they form a unique fingerprint.

Cite this