Combinatorics and complexity of partition functions
From MaRDI portal
Publication:511202
DOI10.1007/978-3-319-51829-9zbMath1367.05002MaRDI QIDQ511202
Publication date: 14 February 2017
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-51829-9
05C31: Graph polynomials
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05A15: Exact enumeration problems, generating functions
05A10: Factorials, binomial coefficients, combinatorial functions
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C45: Eulerian and Hamiltonian graphs
Related Items
Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials, More on zeros and approximation of the Ising partition function, Angle-Restricted Sets and Zero-Free Regions for the Permanent, Stability and complexity of mixed discriminants, Testing for Dense Subsets in a Graph via the Partition Function, Weighted counting of solutions to sparse systems of equations, Approximating real-rooted and stable polynomials, with combinatorial applications, Efficient algorithms for approximating quantum partition functions, Gauges, loops, and polynomials for partition functions of graphical models, The Ising partition function: zeros and deterministic approximation, Orientations, lattice polytopes, and group arrangements. III: Cartesian product arrangements and applications to Tutte type polynomials, Permanental generating functions and sequential importance sampling, Parameterized counting of partially injective homomorphisms, Algorithmic Pirogov-Sinai theory, Large scale stochastic dynamics. Abstracts from the workshop held September 15--21, 2019, A remark on approximating permanents of positive definite matrices, On a conjecture of Sokal concerning roots of the independence polynomial, Computing permanents of complex diagonally dominant matrices and tensors, Uniqueness of Gibbs measures for continuous hardcore models, Probabilistic existence of regular combinatorial structures, Algorithms for #BIS-Hard Problems on Expander Graphs