The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ic.2011.12.007
+Normal rank
@@ Property / OpenAlex ID @@
+W1966841310
@@ Property / OpenAlex ID: W1966841310 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Approximation Complexity Hierarchy
@@ Property / cites work: On the Approximation Complexity Hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501802
@@ Property / cites work: Q5501802 / rank @@
+Normal rank
@@ Property / cites work @@
+A dichotomy theorem for constraint satisfaction problems on a 3-element set
+Normal rank
@@ Property / cites work @@
+The Complexity of the Counting Constraint Satisfaction Problem
+Normal rank
@@ Property / cites work @@
+Holant problems and counting CSP
@@ Property / cites work: Holant problems and counting CSP / rank @@
+Normal rank
@@ Property / cites work @@
+A unified theory of structural tractability for constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+Q4385531
@@ Property / cites work: Q4385531 / rank @@
+Normal rank
@@ Property / cites work @@
+On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
+Normal rank
@@ Property / cites work @@
+Complexity of generalized satisfiability counting problems
+Normal rank
@@ Property / cites work @@
+Complexity Classifications of Boolean Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2003
@@ Property / cites work: Mathematical Foundations of Computer Science 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Tree clustering for constraint networks
@@ Property / cites work: Tree clustering for constraint networks / rank @@
+Normal rank
@@ Property / cites work @@
+Counting \(H-\)colorings of partial \(k-\)trees
@@ Property / cites work: Counting \(H-\)colorings of partial \(k-\)trees / rank @@
+Normal rank
@@ Property / cites work @@
+On Counting Independent Sets in Sparse Graphs
@@ Property / cites work: On Counting Independent Sets in Sparse Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The relative complexity of approximate counting problems
+Normal rank
@@ Property / cites work @@
+The Complexity of Weighted Boolean #CSP
@@ Property / cites work: The Complexity of Weighted Boolean #CSP / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation trichotomy for Boolean \#CSP
@@ Property / cites work: An approximation trichotomy for Boolean \#CSP / rank @@
+Normal rank
@@ Property / cites work @@
+On counting homomorphisms to directed acyclic graphs
+Normal rank
@@ Property / cites work @@
+On Markov Chains for Independent Sets
@@ Property / cites work: On Markov Chains for Independent Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Corrigendum: The complexity of counting graph homomorphisms
+Normal rank
@@ Property / cites work @@
+An Effective Dichotomy for the Counting Constraint Satisfaction Problem
+Normal rank
@@ Property / cites work @@
+Fanout limitations on constraint systems
@@ Property / cites work: Fanout limitations on constraint systems / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
+Normal rank
@@ Property / cites work @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank
@@ Property / cites work @@
+Q2957449
@@ Property / cites work: Q2957449 / rank @@
+Normal rank
@@ Property / cites work @@
+Conjunctive-query containment and constraint satisfaction
+Normal rank
@@ Property / cites work @@
+On the Structure of Polynomial Time Reducibility
@@ Property / cites work: On the Structure of Polynomial Time Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Fast convergence of the Glauber dynamics for sampling independent sets
+Normal rank
@@ Property / cites work @@
+Networks of constraints: Fundamental properties and applications to picture processing
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4139697
@@ Property / cites work: Q4139697 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Counting independent sets up to the tree threshold
+Normal rank
@@ Property / cites work @@
+Q3140234
@@ Property / cites work: Q3140234 / rank @@
+Normal rank