Functional clones and expressibility of partition functions
From MaRDI portal
Publication:2357376
DOI10.1016/j.tcs.2017.05.001zbMath1418.08001arXiv1609.07377OpenAlexW2523839178WikidataQ60560426 ScholiaQ60560426MaRDI QIDQ2357376
Leslie Ann Goldberg, Andrei A. Bulatov, Stanislav Živný, David Richerby, Mark R. Jerrum
Publication date: 13 June 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.07377
Applications of universal algebra in computer science (08A70) Operations and polynomials in algebraic structures, primal algebras (08A40)
Related Items
A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation, Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of approximating conservative counting CSPs
- Potts models and random-cluster processes with many-body interactions
- Inapproximability of the Tutte polynomial of a planar graph
- Closed systems of functions and predicates
- A complexity classification of spin systems with an external field
- Polynomial-Time Approximation Algorithms for the Ising Model
- The Complexity of Ferromagnetic Ising with Local Fields
- Representational Power of Restricted Boltzmann Machines and Deep Belief Networks
- Holographic Algorithms
- Approximating the Partition Function of the Ferromagnetic Potts Model
- Minimizing a Submodular Function on a Lattice
- Analysis of Boolean Functions
- The expressibility of functions on the boolean domain, with applications to counting CSPs
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
