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?
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
