CORC  > 金属研究所  > 中国科学院金属研究所
Computational complexity of spin-glass three-dimensional(3D)Ising model
Zhidong Zhang
刊名材料科学技术:英文版
2020
卷号44.0期号:009页码:116-120
关键词3D Ising model Spin-glass Computational complexity
ISSN号1005-0302
其他题名Computational complexity of spin-glass three-dimensional (3D) Ising model
英文摘要In 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.
资助项目[National Natural Science Foundation of China] ; [State Key Project of Research and Development of of China]
语种中文
CSCD记录号CSCD:6722409
内容类型期刊论文
源URL[http://ir.imr.ac.cn/handle/321006/153983]  
专题金属研究所_中国科学院金属研究所
作者单位中国科学院金属研究所
推荐引用方式
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.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace