暂无分享,去创建一个
[1] M. Mézard,et al. Spin Glass Theory and Beyond , 1987 .
[2] Richard M. Karp,et al. Reducibility among combinatorial problems" in complexity of computer computations , 1972 .
[3] M. Lavagna. Quantum Phase Transitions , 2001, cond-mat/0102119.
[4] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[5] B. Chakrabarti,et al. Quantum Annealing and Related Optimization Methods , 2008 .
[6] Peter C. Cheeseman,et al. Where the Really Hard Problems Are , 1991, IJCAI.
[7] Mikhail N. Vyalyi,et al. Classical and Quantum Computation , 2002, Graduate studies in mathematics.
[8] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] Norman Margolus,et al. Physics and Computation , 1987 .
[11] Akademii︠a︡ medit︠s︡inskikh nauk Sssr. Journal of physics , 1939 .
[12] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[13] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[14] John Watrous,et al. Succinct quantum proofs for properties of finite groups , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[15] J. A. Crowther. Reports on Progress in Physics , 1941, Nature.