Computational complexity of spin-glass three-dimensional(3D)Ising model
Alternative TitleComputational complexity of spin-glass three-dimensional (3D) Ising model
Zhidong Zhang
Source Publication材料科学技术:英文版
AbstractIn this work,the computational complexity of a spin-glass three-dimensional(3D)Ising model(for the lattice sizeN=lmn,wherel,m,n are thenumbersof lattice points along three crystallographic directions)is studied.We prove that an absolute minimum core(AMC)model consisting of a spin-glass 2D Ising model interacting with its nearest neighboring plane,has its computational complexity O(2mn).Any algorithms to make the model smaller(or simpler)than the AMC model will cut the basic element of the spin-glass 3D Ising model and lost many important information of the original model.Therefore,the computational complexity of the spin-glass 3D Ising model cannot be reduced to be less than O(2mn)by any algorithms,which is in subexponential time,superpolynomial.
Keyword3D Ising model Spin-glass Computational complexity
Indexed ByCSCD
Funding Project[National Natural Science Foundation of China] ; [State Key Project of Research and Development of of China]
Citation statistics
Document Type期刊论文
Recommended Citation
GB/T 7714
Zhidong Zhang. Computational complexity of spin-glass three-dimensional(3D)Ising model[J]. 材料科学技术:英文版,2020,44.0(009):116-120.
APA Zhidong Zhang.(2020).Computational complexity of spin-glass three-dimensional(3D)Ising model.材料科学技术:英文版,44.0(009),116-120.
MLA Zhidong Zhang."Computational complexity of spin-glass three-dimensional(3D)Ising model".材料科学技术:英文版 44.0.009(2020):116-120.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Zhidong Zhang]'s Articles
Baidu academic
Similar articles in Baidu academic
[Zhidong Zhang]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Zhidong Zhang]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.