Determine the worst-case computational complexity of approximate counting and sampling for models such as the ferromagnetic Potts model and the hard-core model on bipartite…
Statement
Determine the worst-case computational complexity of approximate counting and sampling for models such as the ferromagnetic Potts model and the hard-core model on bipartite graphs; in particular, is there a polynomial-time algorithm or an NP-hardness result?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.