scientific article; zbMATH DE number 7559110

DOI10.4230/LIPICS.STACS.2019.1MaRDI QIDQ5090447zbMATH OpenFDO

Authors Leslie Ann Goldberg

Publication date 18 July 2022

zbMATH Keywords

approximationpartition functions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 5485444 (Why is no real title available?)
• scientific article; zbMATH DE number 7204480 (Why is no real title available?)
• Approximating the Permanent
• Computing the independence polynomial: from the tree threshold down to the roots
• Computing the permanent of (some) complex matrices
• Counting in two-spin models on \(d\)-regular graphs
• Counting independent sets up to the tree threshold
• Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
• Inapproximability of the independent set polynomial in the complex plane
• On a conjecture of Sokal concerning roots of the independence polynomial
• Spatial mixing and the connective constant: optimal bounds
• Theory of monomer-dimer systems

Cited in

(1)

• scientific article; zbMATH DE number 6341750 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090447)