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

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 but using exponential space. We leave the following problem open: Is there an algorithm for Exact… (More)
DOI: 10.1016/j.ipl.2005.08.011

Topics

Cite this paper

@article{Jurik2006AnAF, title={An algorithm for Exact Satisfiability analysed with the number of clauses as parameter}, author={Bolette Ammitzb\oll Jurik}, journal={Inf. Process. Lett.}, year={2006}, volume={97}, pages={28-30} }