Beyond windability: approximability of the four-vertex model
From MaRDI portal
Publication:6204549
DOI10.1016/J.TCS.2024.114491OpenAlexW4392520315MaRDI QIDQ6204549FDOQ6204549
Authors: Tianyu Liu, Xiongxin Yang 
Publication date: 28 March 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2024.114491
Cites Work
- A Contribution to the Theory of Chromatic Polynomials
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dimer problem in statistical mechanics-an exact result
- Title not available (Why is that?)
- Random generation of combinatorial structures from a uniform distribution
- On the evaluation at (3,3) of the Tutte polynomial of a graph
- On the number of Eulerian orientations of a graph
- Partition function of the eight-vertex lattice model
- Markov chain algorithms for planar lattice structures
- Polynomial-Time Approximation Algorithms for the Ising Model
- Euler and bipartite matroids
- Four-vertex model and random tilings
- Computational complexity of Holant problems
- Canonical Paths for MCMC: from Art to Science
- Title not available (Why is that?)
- The worm process for the Ising model is rapidly mixing
- Title not available (Why is that?)
- Integrable models and combinatorics
- Random cluster dynamics for the Ising model is rapidly mixing
- Approximability of the Six-vertex Model
- Complexity classification of the six-vertex model
- Title not available (Why is that?)
- Approximately Sampling Elements with Fixed Rank in Graded Posets
- Title not available (Why is that?)
This page was built for publication: Beyond windability: approximability of the four-vertex model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204549)
