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

Authors:
Evgeny Dantsin;Edward A. Hirsch;Alexander Wolpert
Affiliations:
Roosevelt University, Chicago, IL;Steklov Institute of Mathematics, Petersburg, Russia;Roosevelt University, Chicago, IL
Venue:
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Year:
2006

Citing 10
Cited 2

Enumerative combinatorics

Enumerative combinatorics
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search

Theoretical Computer Science
Satisfiability - Algorithms and Logic

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Satisfiability Coding Lemma

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
An Improved Exponential-Time Algorithm for k-SAT

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Improved upper bounds for 3-SAT

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An algorithm for the satisfiability problem of formulas in conjunctive normal form

Journal of Algorithms
An improved deterministic local search algorithm for 3-SAT

Theoretical Computer Science
Derandomization of schuler’s algorithm for SAT

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs

Journal of Computer and System Sciences
Experimental study of the shortest reset word of random automat

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata

Quantified Score

Hi-index	0.00

Visualization

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.