为许多NP-complete和NP-hard问题提供了Ising形式,包括Karp的21个NP完全问题中的所有问题。这收集并扩展了从分区、覆盖和可满足性到Ising模型的映射。在每种情况下,所需的自旋数最多是问题大小的三次方。这项工作可能对设计绝热量子优化算法有用。别的优化算法同样有用。
文献:
- 本文Ising formulations of many NP problems
- On the computational complexity of Ising spin glass models
- E. Boros and P.L. Hammer. “Pseudo-Boolean optimization”, Discrete Applied Mathematics 123 155 (2002).
- Reducibility among Combinatorial Problems
- M. Me ́zard and A. Montanari. Information, Physics and Computation (2009)
- Y. Fu and P.W. Anderson. “Application of statistical mechanics to NP-complete problems in combinatorial optimisation”, Journal of Physics A19 1605 (1986).