Cargando…
Computational complexity and statistical physics
Computer science and physics have been closely linked since the birth of modern computing. In recent years, an interdisciplinary area has blossomed at the junction of these fields, connecting insights from statistical physics with basic computational challenges. Researchers have successfully applied...
Autores principales: | , , |
---|---|
Lenguaje: | eng |
Publicado: |
Oxford Univ. Press
2005
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/910613 |
_version_ | 1780908893636919296 |
---|---|
author | Percus, Allon Istrate, Gabriel Moore, Cristopher |
author_facet | Percus, Allon Istrate, Gabriel Moore, Cristopher |
author_sort | Percus, Allon |
collection | CERN |
description | Computer science and physics have been closely linked since the birth of modern computing. In recent years, an interdisciplinary area has blossomed at the junction of these fields, connecting insights from statistical physics with basic computational challenges. Researchers have successfully applied techniques from the study of phase transitions to analyze NP-complete problems such as satisfiability and graph coloring. This is leading to a new understanding of the structure of these problems, and of how algorithms perform on them. Computational Complexity and Statistical Physics will serve as |
id | cern-910613 |
institution | Organización Europea para la Investigación Nuclear |
language | eng |
publishDate | 2005 |
publisher | Oxford Univ. Press |
record_format | invenio |
spelling | cern-9106132021-04-22T02:17:03Zhttp://cds.cern.ch/record/910613engPercus, AllonIstrate, GabrielMoore, CristopherComputational complexity and statistical physicsOther Fields of PhysicsComputer science and physics have been closely linked since the birth of modern computing. In recent years, an interdisciplinary area has blossomed at the junction of these fields, connecting insights from statistical physics with basic computational challenges. Researchers have successfully applied techniques from the study of phase transitions to analyze NP-complete problems such as satisfiability and graph coloring. This is leading to a new understanding of the structure of these problems, and of how algorithms perform on them. Computational Complexity and Statistical Physics will serve as Oxford Univ. Pressoai:cds.cern.ch:9106132005 |
spellingShingle | Other Fields of Physics Percus, Allon Istrate, Gabriel Moore, Cristopher Computational complexity and statistical physics |
title | Computational complexity and statistical physics |
title_full | Computational complexity and statistical physics |
title_fullStr | Computational complexity and statistical physics |
title_full_unstemmed | Computational complexity and statistical physics |
title_short | Computational complexity and statistical physics |
title_sort | computational complexity and statistical physics |
topic | Other Fields of Physics |
url | http://cds.cern.ch/record/910613 |
work_keys_str_mv | AT percusallon computationalcomplexityandstatisticalphysics AT istrategabriel computationalcomplexityandstatisticalphysics AT moorecristopher computationalcomplexityandstatisticalphysics |