Inscriere cercetatori

Daca aveti cont Ad Astra si de Facebook, intrati pe pagina de profil pentru a da dreptul sa va logati pe site doar cu acest buton.

Site nou !

Daca nu va puteti recupera parola (sau aveti alte probleme), scrieti-ne la pagina de contact. Situl vechi se gaseste la adresa


Computational Complexity and Statistical Physics

Domenii publicaţii > Ştiinţe informatice + Tipuri publicaţii > Carte

Autori: Allon Percus, Gabriel Istrate and Cristopher Moore (editors)

Editorial: Oxford University Press, Santa Fe Institute Studies in the Sciences of Complexity, ISBN 019517738X, 2005.


Want create site? Find Free WordPress Themes and plugins.

This Santa Fe Institute volume is intended to be a standard reference to statistical physics methods in computer science theory, particularly in relation to the study of phase transitions in combinatorial problems. It will contain both basic pedagogical material and technical tips and discussions to review the field from a broad perspective. The study of phase transitions in combinatorial problems originated about 50 years ago in work on random graphs by Erdos and Renyi. During the past 10 years, there has been increasing appreciation of the relevance of phase transitions to algorithmic performance on computationally hard problems. Mathematicians, computer scientists and physicists have been working to develop the theoretical tools to understand the processes fundamental to computation. This book should appeal strongly to the interdisciplinary group of information scientists.

Did you find apk for android? You can find new Free Android Games and apps.

Cuvinte cheie: phase transitions in combinatorial problems, computational complexity, statistical physics