Article

Free access

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:

Sorin IstrailAuthors Info & Claims

STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing

Pages 87 - 96

https://doi.org/10.1145/335305.335316

Published: 01 May 2000 Publication History

PDF eReader

References

[1]

F. Barahona. On the computational complexity of ising spin glass models. J. Phys. A: Math. Gen., 15:3241- 3253, 1982.

Google Scholar

[2]

R. J. Baxter. Ezactly Solved Models in Statistical Mechanics. Academic Press, 1982.

Google Scholar

[3]

N. L. Biggs. Interaction Models. Cambridge University Press, 1977.

Google Scholar

[4]

S.' G. Brush. History of the lenz-ising model. Rev. Mod. Phys., 39, 1967.

Google Scholar

[5]

W. Camp. Ising transfer matrix and a d-dimensional fermion model. Phys. Rev. BS, 9, 1973.

Google Scholar

[6]

W. Camp and M. E. Fisher. Decay of order in classical many body systems: Introduction and fromal theory. Phys. Rev. B6, 3, 1972.

Google Scholar

[7]

R. Feynman. Lectures on Statistical Mechanics. Addison-Wesley, 1972.

Google Scholar

[8]

M. Fisher. On the dimer solution of the planar Ising model. J. Math. Phys., 7, 1966.

Google Scholar

[9]

M. E. Fisher. Simple ising models still thrive. Physica, 106, 1981.

Google Scholar

[10]

H. O. Georgii. Gibbs Measures and Phase Transitions. de Gruyter, 1988.

Google Scholar

[11]

S. Goodman and S. Hedetniemi. Eulerian walks in graphs. SIAM J. Computing, 2, 1973.

Google Scholar

[12]

F. O. Hadlock. Finding a maximum cut of a planar graph in polynomial time. SiAM J. Computing, 4, 1975.

Google Scholar

[13]

F. Harary. Feynman's simplification of the kac-ward treatment of the two-dimensional ising problem.

Google Scholar

[14]

F. Harary, editor. Graph Theory and Theoretical Physiscs. Academic Press, 1967.

Google Scholar

[15]

F. Harary. A graphical exposition of the ising problem. J. Australian Mathematical Society, 1971.

Crossref

Google Scholar

[16]

C. A. Hurst. Applicability of the pfaffian method to combinatorial problems on a lattice. Journal of Mathematical Physics, 3(1):90-100, 1964.

Crossref

Google Scholar

[17]

C. A. Hurst. Relation between the onsager and pfaffian methods for solving the ising problem, i. the rectangular lattice. Journal of Mathematical Physics, 6(1):11-18, 1965.

Crossref

Google Scholar

[18]

E. Ising. Beitrag zur theorie des ferromagnetismus. Z. Physics, 31, 1925.

Google Scholar

[19]

F. Jaeger, D. L. Vertigan, and D. j. A. Welsh. On the computational complexity of the jones and tutte polynomials. Math. Proc. Camb. Phil. Soc., 108, 1990.

Google Scholar

[20]

M. Jerrum. Two-dimensional monomer-dimer systems are computationally intractable, j. Star. Phys., 48(1), 1987.

Google Scholar

[21]

M. R. Jerrum and S. A. Polynomial-time approximation algorithms for the ising model. Proc. 17th ICALP, EATCS, 1990.

Digital Library

Google Scholar

[22]

M. Kac. Enigmas of Chance. Harper and Row, 1985.

Google Scholar

[23]

M. Kac and J. C. Ward. A combinatorial solution of the two dimensional ising model. Phys. Rev., 88, 1952.

Google Scholar

[24]

P. W. Kasteleyn. The statistics of dimers on a lattice. i. the number of dimers arrangements of a quadratic lattice. Physica, 27, 1961.

Google Scholar

[25]

P. W. Kasteleyn. Graph theory and crystal physics. Graph Theory and Theoretical Physics (F. Harary ed.), 1967.

Google Scholar

[26]

H. A. Kramers and Wannier. Statistics of the twodimensional ferromagnet, i and ii. Phys. Rev., 60, 1941.

Google Scholar

[27]

L. Lovasz and M. D. Plummet. Matching Theory. North-Holland, 1986.

Digital Library

Google Scholar

[28]

B. M. McCoy and T. T. Wu. The Two-Dimensional Ising Model Harvard University Press, 1973.

Google Scholar

[29]

E. W. Montroll. Lectures on the ising model of phase transitions. Statistical Physics, Phase Transitions and Superfluidity, Brandais University Summer Institute in Theoretical Physics, 2, 1968.

Google Scholar

[30]

G. F. Newell and E. W. Montroll. On the theory of the ising model of ferromagnetism. Reviews of Modern Physics, 25(2):353-389, 1953.

Crossref

Google Scholar

[31]

L. Onsager. Crystal statistics i. a two'dimensional model with an order-disorder transition. Phys. Rev., 65, 1944.

Google Scholar

[32]

G. I. Orlova and Y. G. Dorfman. Finding the maximum cut in a graph. Engr. Cybernetics, 10, 1972.

Google Scholar

[33]

R. Peierls. Ising's model of ferromagnetism. Proc. Camb. Phil. Soc., 32, 1936.

Google Scholar

[34]

S. Sherman. Combinatorial aspects of the ising model of ferromagnetism, i. a conjecture of feynman on paths and graphs. Journal of Mathematical Physics, 1(3):202- 217, 1960.

Crossref

Google Scholar

[35]

H. N. V. Temperley. Two-dimensional ising models. Phase transitions and critical phenomena (Domb, C. and Green, M. $. (ed)), 1, 1974.

Google Scholar

[36]

D. J. A. Welsh. The computational complexity of some classical problems from statistical physics. Disorder in physical systems, pages 307-321, 1990.

Google Scholar

[37]

D. J. A. Welsh. Complexity: Knots, colouring and counting. Cambridge University Press, 1993.

Digital Library

Google Scholar

Cited By

View all

Bernaschi MGonzález-Adalid Pemartín IMartín-Mayor VParisi G(2024)The quantum transition of the two-dimensional Ising spin glassNature10.1038/s41586-024-07647-y631:8022(749-754)Online publication date: 10-Jul-2024
https://doi.org/10.1038/s41586-024-07647-y
Aharonov DIrani S(2023)Translationally Invariant Constraint Optimization ProblemsProceedings of the conference on Proceedings of the 38th Computational Complexity Conference10.4230/LIPIcs.CCC.2023.23(1-15)Online publication date: 17-Jul-2023
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2023.23
Wang T(2023)Oscillators do the hard bitsNature Electronics10.1038/s41928-023-01046-36:10(728-729)Online publication date: 12-Oct-2023
https://doi.org/10.1038/s41928-023-01046-3
Show More Cited By

Index Terms

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)
1. Applied computing
  1. Physical sciences and engineering
    1. Engineering
2. Mathematics of computing
  1. Discrete mathematics
  2. Probability and statistics

Recommendations

NP-completeness and APX-completeness of restrained domination in graphs

Let G=(V,E) be a simple graph. A vertex set S@?V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V-S. In this paper, we investigate the NP-completeness of the restrained domination problem in ...
The NP-completeness of (1,r)-subcolorability of cubic graphs

A partition of the vertices of a graph G into k pairwise disjoint sets V₁, ..., V_k is called an (r₁, ..., r_k)-subcoloring if the subgraph G_i of G induced by V_i, 1 ≤ i ≤ k consists of disjoint complete subgraphs, each of which has cardinality no more ...
NP-completeness of local colorings of graphs

We study the local k-coloring of graphs.We prove that it is NP-complete to determine whether a graph has a local k-coloring for fixed k=4 or k=2t1, where t3.We prove that it is NP-complete to determine whether a planar graph has a local 5-coloring even ...

Comments

Information & Contributors

Information

Published In

STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing

May 2000

756 pages

ISBN:1581131844

DOI:10.1145/335305

Chairmen:
Frances Yao,
Eugene Luks

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC00

Sponsor:

SIGACT

STOC00: The 32nd Annual ACM Symposium on Theory of Computing

May 21 - 23, 2000

Oregon, Portland, USA

Acceptance Rates

STOC '00 Paper Acceptance Rate 85 of 182 submissions, 47%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

67
Total Citations
View Citations
1,548
Total Downloads

Downloads (Last 12 months)161
Downloads (Last 6 weeks)9

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bernaschi MGonzález-Adalid Pemartín IMartín-Mayor VParisi G(2024)The quantum transition of the two-dimensional Ising spin glassNature10.1038/s41586-024-07647-y631:8022(749-754)Online publication date: 10-Jul-2024
https://doi.org/10.1038/s41586-024-07647-y
Aharonov DIrani S(2023)Translationally Invariant Constraint Optimization ProblemsProceedings of the conference on Proceedings of the 38th Computational Complexity Conference10.4230/LIPIcs.CCC.2023.23(1-15)Online publication date: 17-Jul-2023
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2023.23
Wang T(2023)Oscillators do the hard bitsNature Electronics10.1038/s41928-023-01046-36:10(728-729)Online publication date: 12-Oct-2023
https://doi.org/10.1038/s41928-023-01046-3
Takhanov R(2023)Computing a Partition Function of a Generalized Pattern-Based Energy over a SemiringTheory of Computing Systems10.1007/s00224-023-10128-w67:4(760-784)Online publication date: 10-Jul-2023
https://doi.org/10.1007/s00224-023-10128-w
Blom KBlom K(2023)Conclusion and OutlookPair-Correlation Effects in Many-Body Systems10.1007/978-3-031-29612-3_7(163-169)Online publication date: 27-May-2023
https://doi.org/10.1007/978-3-031-29612-3_7
Талалаев ДTalalaev D(2021)Уравнение тетраэдров: алгебра, топология и интегрируемостьTetrahedron equation: algebra, topology, and integrabilityУспехи математических наукUspekhi Matematicheskikh Nauk10.4213/rm1000976:4(460)(139-176)Online publication date: 29-Jul-2021
https://doi.org/10.4213/rm10009
Zhang D(2021)Exact Solution for Three-Dimensional Ising ModelSymmetry10.3390/sym1310183713:10(1837)Online publication date: 1-Oct-2021
https://doi.org/10.3390/sym13101837
Gamarnik DKızıldağ E(2021)Computing the partition function of the Sherrington–Kirkpatrick model is hard on averageThe Annals of Applied Probability10.1214/20-AAP162531:3Online publication date: 1-Jun-2021
https://doi.org/10.1214/20-AAP1625
Talalaev D(2021)Tetrahedron equation: algebra, topology, and integrabilityRussian Mathematical Surveys10.1070/RM1000976:4(685-721)Online publication date: 1-Aug-2021
https://doi.org/10.1070/RM10009
Guo SFriederich PCao YWu TForman CMendoza DDegroote MCavell AKrasecki VHickman RSharma ACronin LGianneschi NGoldsmith RAspuru-Guzik A(2021)A molecular computing approach to solving optimization problems via programmable microdroplet arraysMatter10.1016/j.matt.2021.03.0024:4(1107-1124)Online publication date: Apr-2021
https://doi.org/10.1016/j.matt.2021.03.002
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

NP-completeness and APX-completeness of restrained domination in graphs

The NP-completeness of (1,r)-subcolorability of cubic graphs

NP-completeness of local colorings of graphs

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

NP-completeness and APX-completeness of restrained domination in graphs

The NP-completeness of (1,r)-subcolorability of cubic graphs

NP-completeness of local colorings of graphs

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations