Statistical mechanics, three-dimensionality and NP-completeness: I. Universality of intracatability for the partition function of the Ising model across non-planar surfaces (extended abstract)

@inproceedings{Istrail2000StatisticalMT,
  title={Statistical mechanics, three-dimensionality and NP-completeness: I. Universality of intracatability for the partition function of the Ising model across non-planar surfaces (extended abstract)},
  author={S. Istrail},
  booktitle={STOC '00},
  year={2000}
}
  • S. Istrail
  • Published in STOC '00 2000
  • Computer Science, Mathematics
  • This work provides an exact characterization, across crystal lattices, of the computational tractability frontier for the partition functions of several Ising models. Our results show that beyond planarity computing partition functions is NP-complete. We provide rigorous solutions to several working conjectures in the statistical mechanics literature, such as the Crossed-Bonds conjecture, and the impossibility to compute effectively the partition functions for any three-dimensional lattice… CONTINUE READING
    92 Citations
    The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity
    • 10
    • Highly Influenced
    • PDF
    Computing the Partition Function of the Sherrington-Kirkpatrick Model is Hard on Average
    • D. Gamarnik
    • Mathematics, Computer Science
    • 2020 IEEE International Symposium on Information Theory (ISIT)
    • 2020
    • 3
    • PDF
    Counting Self-avoiding Walks in Some Regular Graphs
    Recent advances in percolation theory and its applications
    • 184
    • PDF
    Commuting quantum circuits and complexity of Ising partition functions
    • 9
    • PDF
    The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
    • 28
    • PDF
    Quantum Commuting Circuits and Complexity of Ising Partition Functions
    • 19
    • PDF
    Title Commuting quantum circuits and complexity of Ising partitionfunctions
    Hardness of parameter estimation in graphical models
    • 28
    • PDF

    References

    SHOWING 1-4 OF 4 REFERENCES
    On the computational complexity of Ising spin glass models
    • 856
    • Highly Influential
    • PDF
    On the Dimer Solution of Planar Ising Models
    • 247
    • Highly Influential
    On the computational complexity of the Jones and Tutte polynomials
    • 432
    • Highly Influential
    On Ising's model of ferromagnetism
    • 597
    • Highly Influential