| Computational Complexity and Statistical Physics Contributor(s): Percus, Allon (Editor), Istrate, Gabriel (Editor), Moore, Cristopher (Editor) |
|
 |
ISBN: 0195177371 ISBN-13: 9780195177374 Publisher: Oxford University Press, USA OUR PRICE: $257.40 Product Type: Hardcover - Other Formats Published: February 2006 Annotation: 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 a standard reference and pedagogical aid to statistical physics methods in computer science, with a particular focus on phase transitions in combinatorial problems. Addressed to a broad range of readers, the book includes substantial background material along with current research by leading computer scientists, mathematicians, and physicists. It will prepare students and researchers from all of these fields to contribute to this exciting area. |
| Additional Information |
| BISAC Categories: - Mathematics | Logic - Computers | Computer Science - Mathematics | Probability & Statistics - General |
| Dewey: 511.352 |
| LCCN: 2005047785 |
| Physical Information: 0.88" H x 6.14" W x 9.21" (1.57 lbs) 384 pages |
| Descriptions, Reviews, Etc. |
| Publisher 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 a standard reference and pedagogical aid to statistical physics methods in computer science, with a particular focus on phase transitions in combinatorial problems. Addressed to a broad range of readers, the book includes substantial background material along with current research by leading computer scientists, mathematicians, and physicists. It will prepare students and researchers from all of these fields to contribute to this exciting area. |
