$\#$BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470): Difference between revisions

@@ Property / author @@
-Mark R. Jerrum
@@ Property / author: Mark R. Jerrum / rank @@
-Normal rank
@@ Property / author @@
-Daniel Štefanković
@@ Property / author: Daniel Štefanković / rank @@
-Normal rank
@@ Property / author @@
+Mark R. Jerrum
@@ Property / author: Mark R. Jerrum / rank @@
+Normal rank
@@ Property / author @@
+Daniel Štefanković
@@ Property / author: Daniel Štefanković / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1770469170
@@ Property / OpenAlex ID: W1770469170 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4451
@@ Property / arXiv ID: 1311.4451 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of the Counting Constraint Satisfaction Problem
+Normal rank
@@ Property / cites work @@
+The expressibility of functions on the boolean domain, with applications to counting CSPs
+Normal rank
@@ Property / cites work @@
+Complexity of counting CSP with complex weights
@@ Property / cites work: Complexity of counting CSP with complex weights / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability after Uniqueness Phase Transition in Two-Spin Systems
+Normal rank
@@ Property / cites work @@
+Holant problems and counting CSP
@@ Property / cites work: Holant problems and counting CSP / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of approximating conservative counting CSPs.
+Normal rank
@@ Property / cites work @@
+The relative complexity of approximate counting problems
+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 @@
+An Effective Dichotomy for the Counting Constraint Satisfaction Problem
+Normal rank
@@ Property / cites work @@
+Improved inapproximability results for counting independent sets in the hard-core model
+Normal rank
@@ Property / cites work @@
+Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
+Normal rank
@@ Property / cites work @@
+Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region
+Normal rank
@@ Property / cites work @@
+Q2908853
@@ Property / cites work: Q2908853 / rank @@
+Normal rank
@@ Property / cites work @@
+Gibbs measures and phase transitions.
@@ Property / cites work: Gibbs measures and phase transitions. / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Ferromagnetic Ising with Local Fields
+Normal rank
@@ Property / cites work @@
+A counterexample to rapid mixing of the Ge-Stefankovic process
+Normal rank
@@ Property / cites work @@
+Approximating the Partition Function of the Ferromagnetic Potts Model
+Normal rank
@@ Property / cites work @@
+Approximating the partition function of planar two-state spin systems
+Normal rank
@@ Property / cites work @@
+The computational complexity of two‐state spin systems
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Approximation Algorithms for the Ising Model
+Normal rank
@@ Property / cites work @@
+Q3721805
@@ Property / cites work: Q3721805 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Counting via Correlation Decay in Spin Systems
+Normal rank
@@ Property / cites work @@
+Correlation Decay up to Uniqueness in Spin Systems
+Normal rank
@@ Property / cites work @@
+The Complexity of Ferromagnetic Two-spin Systems with External Fields
+Normal rank
@@ Property / cites work @@
+On the hardness of sampling independent sets beyond the tree threshold
+Normal rank
@@ Property / cites work @@
+Q5743449
@@ Property / cites work: Q5743449 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting independent sets up to the tree threshold
+Normal rank
@@ Property / cites work @@
+On Unapproximable Versions of $NP$-Complete Problems
+Normal rank

\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470): Difference between revisions

Latest revision as of 20:17, 11 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)