Approximability of the eight-vertex model
From MaRDI portal
Cites work
- A random polynomial-time algorithm for approximating the volume of convex bodies
- An effective dichotomy for the counting constraint satisfaction problem
- Approximability of the Six-vertex Model
- Approximating the Permanent
- Complexity Dichotomies for Counting Problems
- Complexity of counting CSP with complex weights
- scientific article; zbMATH DE number 3856167 (Why is no real title available?)
- scientific article; zbMATH DE number 1092415 (Why is no real title available?)
- scientific article; zbMATH DE number 1885142 (Why is no real title available?)
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Monte-Carlo algorithms for the planar multiterminal network reliability problem
- Node-and edge-deletion NP-complete problems
- Perfect matchings, rank of connection tensors and graph homomorphisms
- Random generation of combinatorial structures from a uniform distribution
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Slow mixing of Markov chains using fault lines and fat contours
- The complexity of complex weighted Boolean \#CSP
- The complexity of the counting constraint satisfaction problem
Cited in
(4)
This page was built for publication: Approximability of the eight-vertex model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092451)
