An algorithm for exact satisfiability analysed with the number of clauses as parameter

Authors:
Bolette Ammitzbøll Madsen
Affiliations:
BRICS, Department of Computer Science, University of Aarhus, Denmark
Venue:
Information Processing Letters
Year:
2006

Citing 6
Cited 0

New Worst-Case Upper Bounds for SAT

Journal of Automated Reasoning
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
New algorithms for exact satisfiability

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
On some weighted satisfiability and graph problems

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Enumerating maximal independent sets with applications to graph colouring

Operations Research Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

We give an algorithm for Exact Satisfiability with polynomial space usage and a time bound of poly(L) ċ m!, where m is the number of clauses and L is the length of the formula. Skjernaa has given an algorithm for Exact Satisfiability with time bound poly(L) ċ 2m but using exponential space. We leave the following problem open: Is there an algorithm for Exact Satisfiability using only polynomial space with a time bound of cm, where c is a constant and m is the number of clauses?