Preface, Allon G. Percus, Gabriel Istrate, and Cristopher Moore
Part 1: Fundamentals
1. Introduction: Where Statistical Physics Meets Computation, Allon G. Percus, Gabriel Istrate, and
Cristopher Moore
2. Threshold Phenomena and Influence: Perspectives from Mathematics, Computer Science, and Economics, Gil Kalai and Shmuel Safra
Part 2: Statistical Physics and Algorithms
3. Analyzing Search Algorithms with Physical Methods, Simona Cocco, Remi Monasson, Andrea Montanari, and Guilhem Semerjian
4. Constraint Satisfaction by Survey Propagation, Alfredo Braunstein, Marc Mezard, Martin Weigt, and Riccardo Zecchina
5. The Easiest Hard Problem: Number Partitioning, Stephan Mertens
6. Ground States, Energy Landscape and Low-Temperature Dynamics of plus/minus Spin Glasses, Sigismund Kobe and Jarek Krawczyk
Part 3: Identifying the Threshold
7. The Satisfiability Threshold Conjecture: Techniques Behind Upper Bound Improvements, Lefteris M. Kirousis, Yannis C. Stamatiou, and Michele Zito
8. Proving Conditional Randomness Using the Principle of Deferred Decisions, Alexis C. Kaporis, Lefteris M. Kirousis, and Yannis C. Stamatiou
9. The Phase Transition in the Random HornSAT Problem, Demetrios D. Demopoulos, and Moshe Y. Vardi
Part 4: Extensions and Applications
10. Phase Transitions for Quantum Search Algorithms, Tad Hogg
11. Scalability, Random Surfaces and Synchronized Computing Networks, Zoltan Toroczkai, Gyorgy Korniss, Mark A. Novotny, and Hasan Guclu
12. Combinatorics of Genotype-Phenotype Maps: An RNA Case Study, Christian M. Reidys
13. Towards a Predictive Computational Complexity Theory for Periodically Specified Problems: A Survey, Harry B. Hunt, III, Madhav V. Marathe, Daniel J. Rosenkrantz, and Richard E. Stearns
Bibliography
Index