The Complexity of Ferromagnetic Ising with Local Fields

From MaRDI portal
Revision as of 18:50, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3429740

DOI10.1017/S096354830600767XzbMath1170.82001OpenAlexW1977162457MaRDI QIDQ3429740

Leslie Ann Goldberg, Mark R. Jerrum

Publication date: 20 March 2007

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096354830600767x




Related Items (24)

\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness regionCompleteness Results for Counting Problems with Easy DecisionOn some properties of the low-dimensional Gumbel perturbations in the perturb-and-MAP modelApproximately counting locally-optimal structuresApproximately Counting Locally-Optimal StructuresLower bounds for testing graphical models: colorings and antiferromagnetic Ising modelsA Graph Polynomial for Independent Sets of Bipartite GraphsLow depth quantum circuits for Ising modelsThe Complexity of Approximately Counting Tree HomomorphismsPolynomial-time algorithms for multimarginal optimal transport problems with structureSwendsen-Wang dynamics for the ferromagnetic Ising model with external fieldsApproximately counting independent sets in bipartite graphs via graph containersCommuting quantum circuits and complexity of Ising partition functionsA complexity trichotomy for \(k\)-regular asymmetric spin systems using number theoryA complexity classification of spin systems with an external fieldApproximation Algorithms for the Random Field Ising ModelThe complexity of approximately counting stable roommate assignmentsThe complexity of approximately counting stable matchingsCounting Constraint Satisfaction Problems.The Tutte-Potts connection in the presence of an external magnetic fieldApproximately Counting $H$-Colorings is $\#\mathrm{BIS}$-HardBoolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spinUnnamed ItemFunctional clones and expressibility of partition functions







This page was built for publication: The Complexity of Ferromagnetic Ising with Local Fields