论文信息 - Computational science: A hard statistical view

Computational science: A hard statistical view

The sheer number of variables and logical conditions makes some computing problems seem intractable. Statistical physics, normally used to study huge groups of interacting particles, can supply powerful tools to crack them.

Bart Selman | B. Selman

[1] Rémi Monasson,et al. Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.

[2] Bart Selman,et al. Computational science: Can get satisfaction , 2005, Nature.

[3] M. Mézard,et al. Analytic and Algorithmic Solution of Random Satisfiability Problems , 2002, Science.

[4] Martin J. Wainwright,et al. A new look at survey propagation and its generalizations , 2004, SODA '05.

[5] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[6] S Kirkpatrick,et al. Critical Behavior in the Satisfiability of Random Boolean Expressions , 1994, Science.

[7] Thierry Mora,et al. Clustering of solutions in the random satisfiability problem , 2005, Physical review letters.

[8] M. Mézard,et al. Statistical mechanics of the hitting set problem. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.