Abstract is missing.
- Introduction: Where Statistical Physics Mects ComputationAllon G. Percus, Gabriel Istrate, Cristopher Moore. 3-24
- Threshold Phenomena and Influence: Perspectives from Mathematics, Computer Science, and EconomicsGil Kalai, Shmuel Safra. 25-62
- Analyzing Search Algorithms with Physical MethodsSimona Cocco, Rémi Monasson, Andrea Montanari, Guilhem Semerjian. 63-106
- Constraint Satisfaction by Survey PropagationAlfredo Braunstein, Marc Mézard, Martin Weigt, Riccardo Zecchina. 107-124
- The Easiest Hard Problem: Number PartitioningStephan Mertens. 125-140
- Ground States, Energy Landscape, and Low-Temperature Dynamics of ±J Spin GlassesSigismund Kobe, Jarek Krawczyk. 141-158
- The Satisfiability Threshold Conjecture: Techniques Behind Upper Bound ImprovementsLefteris M. Kirousis, Yannis C. Stamatiou, Michele Zito. 159-178
- Proving Conditional Randomness using The Principle of Deferred DecisionsAlexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou. 179-194
- The Phase Transition in the Random HornSAT ProblemDemetrios D. Demopoulos, Moshe Y. Vardi. 195-222
- Phase Transitions for Quantum Search AlgorithmsTad Hogg. 223-248
- Scalability, Random Surfaces, and Synchronized Computing NetworksZoltán Toroczkai, György Korniss, Mark A. Novotny, Hasan Guclu. 249-270
- Combinatorics of Genotype-Phenotype Maps: An RNA Case StudyChristian M. Reidys. 271-284
- Towards a Predictive Computational Complexity TheoryHarry B. Hunt III, Madhav V. Marathe, Daniel J. Rosenkrantz, Richard Edwin Stearns. 285