Author:
Demir V.,Akbulut M.,Nguyen D. T.,Kaneda Y.,Neifeld M.,Peyghambarian N.
Funder
United States Department of Defense | United States Navy | Office of Naval Research
Publisher
Springer Science and Business Media LLC
Reference18 articles.
1. Lucas, A. Ising formulations of many NP problems. Front. Phys. 2, 5 (2014).
2. Barahona, F. On the computational complexity of Ising spin glass models. J. Phys. Math. Gen. 15, 3241–3253 (1982).
3. Hopfield, J. J. & Tank, D. W. Computing with neural circuits: A model. Science 233, 625–633 (1986).
4. Korte, B., Vygen, J. Combinatorial Optimization (Springer-Verlag, 2012).
5. Garey, M. R., Johnson, D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, W. H., New York, 1979).
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献