Optimal cooperation and submodularity for computing Potts partition functions with a large number of states
From MaRDI portal
Publication:4466031
DOI10.1088/0305-4470/35/33/301zbMath1040.82007arXivcond-mat/0204055OpenAlexW2116713392MaRDI QIDQ4466031
András Sebő, Ferenc Iglói, J.-Ch. Anglès D'Auriac, Myriam Preissmann
Publication date: 9 June 2004
Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/0204055
Related Items (9)
A faster algorithm for computing the principal sequence of partitions of a graph ⋮ Hypergraphic submodular function minimization ⋮ Graphic Submodular Function Minimization: A Graphic Approach and Applications ⋮ Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms ⋮ On the complexity of submodular function minimisation on diamonds ⋮ Excess entropy and central charge of the two-dimensional random-bond Potts model in the large-Q limit ⋮ A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions ⋮ Submodular function minimization ⋮ Network reinforcement
This page was built for publication: Optimal cooperation and submodularity for computing Potts partition functions with a large number of states
