Author:
Karimi Kamran,Dickson Neil G.,Hamze Firas,Amin M. H. S.,Drew-Brook Marshall,Chudak Fabian A.,Bunyk Paul I.,Macready William G.,Rose Geordie
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Modeling and Simulation,Signal Processing,Theoretical Computer Science,Statistical and Nonlinear Physics,Electronic, Optical and Magnetic Materials
Reference37 articles.
1. Garey M.K., Johnson D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1997)
2. Woeringer, G.J.: Exact Algorithms for NP-Hard Problems: A Survey. Lecture Notes in Computer Science. vol. 2570, pp. 185–207 (2003)
3. http://us.eternityii.com/
4. Kadowaki T., Nishimori H.: Quantum annealing in the transverse Ising model. Phys. Rev. E 58, 5355 (1998)
5. Farhi E., Goldstone J., Gutmann S., Lapan J., Lundgren A., Preda D.: A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science 292(5516), 472–475 (2001)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献