Approximability of the eight-vertex model

DOI10.4230/LIPIcs.CCC.2020.4OpenAlexW3138442806MaRDI QIDQ5092451

No author found.

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1811.03126

zbMATH Keywords

Markov chain Monte Carlothe eight-vertex modelapproximate complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Approximability of the complementarily symmetric Holant problems on cubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of complex weighted Boolean \#CSP
• Slow mixing of Markov chains using fault lines and fat contours
• Monte-Carlo algorithms for the planar multiterminal network reliability problem
• Random generation of combinatorial structures from a uniform distribution
• An Effective Dichotomy for the Counting Constraint Satisfaction Problem
• Approximating the Permanent
• Reflection positivity, rank connectivity, and homomorphism of graphs
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• A random polynomial-time algorithm for approximating the volume of convex bodies
• Complexity Dichotomies for Counting Problems
• Complexity of Counting CSP with Complex Weights
• Perfect Matchings, Rank of Connection Tensors and Graph Homomorphisms
• Approximability of the Six-vertex Model
• The complexity of the counting constraint satisfaction problem
• Node-and edge-deletion NP-complete problems

This page was built for publication: Approximability of the eight-vertex model