Pages that link to "Item:Q4602373"

The following pages link to Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials (Q4602373):

Displaying 50 items.

• On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs (Q824265) (← links)
• The Ising partition function: zeros and deterministic approximation (Q1730971) (← links)
• Computing the number of induced copies of a fixed graph in a bounded degree graph (Q1741847) (← links)
• Contraction: a unified perspective of correlation decay and zero-freeness of 2-spin systems (Q2060009) (← links)
• The complexity of approximating the complex-valued Potts model (Q2125077) (← links)
• Zero-freeness and approximation of real Boolean Holant problems (Q2143138) (← links)
• Zeros and approximations of holant polynomials on the complex plane (Q2169310) (← links)
• Algorithmic Pirogov-Sinai theory (Q2174663) (← links)
• Large scale stochastic dynamics. Abstracts from the workshop held September 15--21, 2019 (Q2206640) (← links)
• Some applications of Wagner's weighted subgraph counting polynomial (Q2236817) (← links)
• Cayley trees do not determine the maximal zero-free locus of the independence polynomial (Q2238459) (← links)
• On a conjecture of Sokal concerning roots of the independence polynomial (Q2286792) (← links)
• Computing permanents of complex diagonally dominant matrices and tensors (Q2317703) (← links)
• Fast mixing via polymers for random graphs with unbounded degree (Q2672271) (← links)
• A Note on Deterministic Poly-Time Algorithms for Partition Functions Associated with Boolean Matrices with Prescribed Row and Column Sums (Q2849938) (← links)
• Location of zeros for the partition function of the Ising model on bounded degree graphs (Q3296755) (← links)
• Algorithms for #BIS-Hard Problems on Expander Graphs (Q3304735) (← links)
• Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
• More on zeros and approximation of the Ising partition function (Q4992410) (← links)
• Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model (Q5009783) (← links)
• Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs (Q5028870) (← links)
• A Spectral Independence View on Hard Spheres via Block Dynamics (Q5043635) (← links)
• Lee-Yang zeros of the antiferromagnetic Ising model (Q5081587) (← links)
• The complexity of approximating the complex-valued Potts model (Q5089203) (← links)
• Fisher Zeros and Correlation Decay in the Ising Model (Q5090433) (← links)
• (Q5090447) (← links)
• The complexity of approximating the matching polynomial in the complex plane (Q5091171) (← links)
• (Q5092461) (← links)
• Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing (Q5096108) (← links)
• Inapproximability of the Independent Set Polynomial in the Complex Plane (Q5129229) (← links)
• Fisher zeros and correlation decay in the Ising model (Q5205182) (← links)
• Stability and complexity of mixed discriminants (Q5207439) (← links)
• Testing for Dense Subsets in a Graph via the Partition Function (Q5212953) (← links)
• Approximating real-rooted and stable polynomials, with combinatorial applications (Q5216314) (← links)
• Weighted counting of solutions to sparse systems of equations (Q5222549) (← links)
• Efficient algorithms for approximating quantum partition functions (Q5855662) (← links)
• The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs (Q5866450) (← links)
• (Q5875497) (← links)
• (Q5875505) (← links)
• Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree (Q5885192) (← links)
• Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction (Q5885600) (← links)
• Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs (Q5890038) (← links)
• Absence of zeros implies strong spatial mixing (Q6045833) (← links)
• Smoothed counting of 0–1 points in polyhedra (Q6051058) (← links)
• Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
• Fast algorithms at low temperatures via Markov chains† (Q6073630) (← links)
• Counting independent sets in graphs with bounded bipartite pathwidth (Q6074656) (← links)
• Correlation decay and the absence of zeros property of partition functions (Q6077053) (← links)
• Uniqueness of the Gibbs measure for the anti-ferromagnetic Potts model on the infinite \(\Delta \)-regular tree for large \(\Delta \) (Q6081416) (← links)
• Approximating the chromatic polynomial is as hard as computing it exactly (Q6121107) (← links)