One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
Open Access
PDF Availablehttps://doi.org/10.3103/s1060992x17020035
Copy DOI
Export
Save
Share
Cite Journal: Optical Memory and Neural Networks |  Publication Date: Apr 1, 2017 |
 Citations: 14 |
Affiliation: Research Institute for System Studies
In this paper we propose and realize an algorithm for exact calculation of partition function for planar graph models with binary variables. The complexity of the algorithm is O(N 2) Experiments show good agreement with Onsager’s analytical solution for the two-dimensional Ising model of infinite size.
Free) 
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
