Short works

Books : reviews

Allon G. Percus, Gabriel Istrate, Cristopher Moore, eds.
Computational Complexity and Statistical Physics.
OUP. 2006


Introduction: where statistical physics meets computation. 2006
Gil Kalai, Shmuel Safra. Threshold phenomena and influence: perspectives from mathematics, computer science, and economics. 2006
Simona Cocca, Remi Monasson, Andrea Montanari, Guilhem Semerjian. Analyzing search algorithms with physical methods. 2006
Alfredo Bausnstein, Marc Mezard, Martin Weigt, Riccardo Zecchina. Constraint satisfaction by survey propagation. 2006
Stephan Mertens. The easiest hard problem: number partitioning. 2006
Sigismund Kobe, Jarek Krawczyk. Ground states, energy landscape, and low-temperature dynamics of +/-J spin glasses. 2006
Lefteris M. Kirousis, Yannis C. Stamatiou, Michele Zito. The satisfiability threshold conjecture: techniques behind upper bound improvements. 2006
Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou. Proving conditional randomness using the principla of deferred decisions. 2006
Demetrios D. Demopoulos, Moshe Y. Vardi. The phase transition in the random HornSAT problem. 2006
Tad Hogg. Phase transitions for quantum search algorithms. 2006
Zoltan Toroczkai, Gyorgy Korniss, Mark A. Novotny, Hasan Guclu. Scalability, random surfaces, and synchronized computing networks. 2006
Christian M. Reidys. Combinatorics of genotype-phenotype maps: an RNA case study. 2006
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. 2006