On generating all maximal independent sets
Information Processing Letters
An algorithm for counting maximum weighted independent sets and its applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Algorithms for four variants of the exact satisfiability problem
Theoretical Computer Science
Solving minimum weight exact satisfiability in time O(20.2441n)
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On some weighted satisfiability and graph problems
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Algorithms for variable-weighted 2-SAT and dual problems
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
| Hi-index | 0.00 |
We show that the number of all solutions of minimum weight exact satisfiability can be found in O(n2.||C||+20.40567 n) time, for a CNF formula C containing n propositional variables equipped with arbitrary real-valued weights. In recent years merely the unweighted counterpart of this problem has been studied [2, 3, 7].