Statistical mechanics, three-dimensionality and NP-completeness
From MaRDI portal
Publication:3191975
DOI10.1145/335305.335316zbMath1296.82012OpenAlexW2086333739WikidataQ56212880 ScholiaQ56212880MaRDI QIDQ3191975
Publication date: 26 September 2014
Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/335305.335316
Analysis of algorithms and problem complexity (68Q25) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items (17)
Sampling Algorithms for Discrete Markov Random Fields and Related Graphical Models ⋮ Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations ⋮ A novel approach to Ising problems ⋮ Commuting quantum circuits and complexity of Ising partition functions ⋮ The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. ⋮ Why are all dualities conformal? Theory and practical consequences ⋮ Computing a partition function of a generalized pattern-based energy over a semiring ⋮ Clifford algebra approach of 3D Ising model ⋮ Completeness of classical spin models and universal quantum computation ⋮ Computing the partition function of the Sherrington-Kirkpatrick model is hard on average ⋮ Recent advances in percolation theory and its applications ⋮ Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP ⋮ The role of crossover operator in the genetic optimization of magnetic models ⋮ Stochastic minority on graphs ⋮ A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing ⋮ Towards integrable structure in 3d Ising model ⋮ Unnamed Item
This page was built for publication: Statistical mechanics, three-dimensionality and NP-completeness
