author : Allon G. Percus

Contents

• Allon G. Percus, Gabriel Istrate, Cristopher Moore.

Introduction: where statistical physics meets computation

• Gil Kalai, Shmuel Safra.

Threshold phenomena and influence: perspectives from mathematics, computer science, and economics

• Simona Cocca, Remi Monasson, Andrea Montanari, Guilhem Semerjian.

Analyzing search algorithms with physical methods

• Alfredo Bausnstein, Marc Mezard, Martin Weigt, Riccardo Zecchina.

Constraint satisfaction by survey propagation

• Stephan Mertens.

The easiest hard problem: number partitioning

• Sigismund Kobe, Jarek Krawczyk.

Ground states, energy landscape, and low-temperature dynamics of +/-J spin glasses

• Lefteris M. Kirousis, Yannis C. Stamatiou, Michele Zito.

The satisfiability threshold conjecture: techniques behind upper bound improvements

• Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou.

Proving conditional randomness using the principla of deferred decisions

• Demetrios D. Demopoulos, Moshe Y. Vardi.

The phase transition in the random HornSAT problem

• Tad Hogg.

Phase transitions for quantum search algorithms

• Zoltan Toroczkai, Gyorgy Korniss, Mark A. Novotny, Hasan Guclu.

Scalability, random surfaces, and synchronized computing networks

• Christian M. Reidys.

Combinatorics of genotype-phenotype maps: an RNA case study

• Harry B. Hunt III, Madhav V. Marathe, Daniel J. Rozenkrantz, Richard E. Stearns.

Towards a predictive computational complexity theory for periodically specified problems: a survey