scientific article; zbMATH DE number 7559110

DOI10.4230/LIPIcs.STACS.2019.1MaRDI QIDQ5090447

Leslie Ann Goldberg

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximationpartition functions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Computing the permanent of (some) complex matrices
• Counting in two-spin models on \(d\)-regular graphs
• On a conjecture of Sokal concerning roots of the independence polynomial
• Spatial mixing and the connective constant: optimal bounds
• Theory of monomer-dimer systems
• Counting independent sets up to the tree threshold
• Approximating the Permanent
• Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
• Computing the Independence Polynomial: from the Tree Threshold down to the Roots
• Inapproximability of the independent set polynomial in the complex plane

This page was built for publication: