Using binary patterns for counting falsifying assignments of conjunctive forms (Q2520658): Difference between revisions

@@ Property / cites work @@
+Improved Bonferroni inequalities via abstract tubes. Inequalities and identities of inclusion-exclusion type
+Normal rank
@@ Property / cites work @@
+Inclusion-exclusion: exact and approximate
@@ Property / cites work: Inclusion-exclusion: exact and approximate / rank @@
+Normal rank
@@ Property / cites work @@
+Counting models for 2SAT and 3SAT formulae
@@ Property / cites work: Counting models for 2SAT and 3SAT formulae / rank @@
+Normal rank
@@ Property / cites work @@
+Q2892663
@@ Property / cites work: Q2892663 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting the number of solutions for instances of satisfiability
+Normal rank
@@ Property / cites work @@
+A bounded approximation for the minimum cost 2-sat problem
+Normal rank
@@ Property / cites work @@
+Approximate inclusion-exclusion
@@ Property / cites work: Approximate inclusion-exclusion / rank @@
+Normal rank
@@ Property / cites work @@
+Counting propositional models
@@ Property / cites work: Counting propositional models / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximate reasoning
@@ Property / cites work: On the hardness of approximate reasoning / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting in Sparse, Regular, and Planar Graphs
+Normal rank
@@ Property / cites work @@
+A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
+Normal rank