Counting the number of solutions for instances of satisfiability
Theoretical Computer Science
The design and analysis of algorithms
The design and analysis of algorithms
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Number of models and satisfiability of sets of clauses
Theoretical Computer Science
Counting Satisfying Assignments in 2-SAT and 3-SAT
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Improved upper bounds for 3-SAT
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Quasiconvex analysis of backtracking algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An improved deterministic local search algorithm for 3-SAT
Theoretical Computer Science
Counting models for 2SAT and 3SAT formulae
Theoretical Computer Science
An algorithm for the SAT problem for formulae of linear length
ESA'05 Proceedings of the 13th annual European conference on Algorithms
On Independent Sets and Bicliques in Graphs
Graph-Theoretic Concepts in Computer Science
Counting independent sets in claw-free graphs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Counting maximal independent sets in subcubic graphs
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
An exact exponential time algorithm for counting bipartite cliques
Information Processing Letters
A Threshold for a Polynomial Solution of #2SAT
Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
Computing #2SAT and #2UNSAT by binary patterns
MCPR'12 Proceedings of the 4th Mexican conference on Pattern Recognition
Exploiting independent subformulas: A faster approximation scheme for #k-SAT
Information Processing Letters
Determining the L(2,1)-span in polynomial space
Discrete Applied Mathematics
Solving min ones 2-sat as fast as vertex cover
Theoretical Computer Science
Computing the differential of a graph: Hardness, approximability and exact algorithms
Discrete Applied Mathematics
| Hi-index | 0.00 |
We give an algorithm for counting the number of max-weight solutions to a 2SAT formula, and improve the bound on its running timeto O(1.2377n). The main source of the improvement is a refinement ofthe method of analysis, where we extend the concept of compound (piecewiselinear) measures to multivariate measures, also allowing the optimalparameters for the measure to be found automatically. This method extensionshould be of independent interest.