An algorithm for Exact Satisfiability analysed with the number of clauses as parameter

Authors:
Bolette Ammitzbøll Madsen
Affiliations:
BRICS,11Basic Research in Computer Science (http://www.brics.dk), funded by the Danish National Research Foundation. Department of Computer Science, University of Aarhus, Denmark
Venue:
Information Processing Letters
Year:
2006

Citing 5
Cited 3

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
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

Exact algorithms for exact satisfiability and number of perfect matchings

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The worst-case upper bound for exact 3-satisfiability with the number of clauses as the parameter

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Solving single-digit sudoku subproblems

FUN'12 Proceedings of the 6th international conference on Fun with Algorithms

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)@?2^m 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 c^m, where c is a constant and m is the number of clauses?