Author:
Wang Zhe,Marandi Alireza,Takata Kenta,Byer Robert L.,Yamamoto Yoshihisa
Reference45 articles.
1. F. Barahona, On the computational complexity of Ising spin glass model. J. Phys. A Math. Gen. 15, 3241–3253 (1982)
2. V. Dotsenko, Introduction to the Replica Theory of Disordered Statistical Systems (Cambridge University Press, Cambridge, 2000)
3. K. Binder, A.P. Young, Spin glasses: experimental facts, theoretical concepts and open questions. Rev. Mod. Phys. 58, 801–976 (1986)
4. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979)
5. R.M. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations, ed. by R.E. Millera, J.W. Thatcher (Plenum Press, New York, 1972), pp. 85–103
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献