Computing the Partition Function of a Polynomial on the Boolean Cube
From MaRDI portal
Publication:4604373
DOI10.1007/978-3-319-44479-6_7zbMath1411.90218arXiv1503.07463OpenAlexW1548726646MaRDI QIDQ4604373
Publication date: 26 February 2018
Published in: A Journey Through Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.07463
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Boolean programming (90C09) Approximation algorithms (68W25)
Related Items
Correlation decay and the absence of zeros property of partition functions, Counting independent sets in graphs with bounded bipartite pathwidth, Weighted counting of solutions to sparse systems of equations, More on zeros and approximation of the Ising partition function
Cites Work
- Unnamed Item
- Unnamed Item
- Computing the permanent of (some) complex matrices
- Pseudo-Boolean optimization
- Computing the partition function for graph homomorphisms with multiplicities
- Inclusion-exclusion: exact and approximate
- On bounded occurrence constraint satisfaction
- Zero-free regions of partition functions with applications to algorithms and graph limits
- Completely analytical interactions: Constructive description
- Grothendieck-Type Inequalities in Combinatorial Optimization
- Counting independent sets up to the tree threshold
- Computing the partition function for cliques in a graph
- Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
- Some optimal inapproximability results
- Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation
- Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model
- On the advantage over a random assignment
