Spin Systems: Hardness of Approximate Counting via Phase Transitions
summary
Covers hardness results for approximate counting in spin systems by linking computational difficulty to phase transitions from statistical physics, focusing on counting problems for models like the Ising and Potts-type spin systems and using phase-transition behavior to prove intractability.
AI-written summary · about