Code generation using tree matching and dynamic programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
A new viewpoint on code generation for directed acyclic graphs
ACM Transactions on Design Automation of Electronic Systems (TODAES)
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
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
An algorithm for exact satisfiability analysed with the number of clauses as parameter
Information Processing Letters
An algorithm for Exact Satisfiability analysed with the number of clauses as parameter
Information Processing Letters
Algorithms for variable-weighted 2-SAT and dual problems
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Solving minimum weight exact satisfiability in time O(20.2441n)
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Counting all solutions of minimum weight exact satisfiability
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
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
| Hi-index | 0.00 |
In the first part of this paper we address several weighted satisfiability problems. Among others, we provide linear time algorithms solving the optimization problems MINV(MAXV)-NAESAT and MINV (MAXV)-XSAT for 2CNF formulas and arbitrary real weights assigned to the variables. In a second part we consider the relationship between the problems maximum weight independent set (MAX-IS) in a graph and the problem XSAT. We show that the counting problem #XSAT can be solved in time O(20.40567n) thereby significantly improving on a bound O(20.81131n) provided in [4].