Computational Complexity and Statistical Physics

Computational Complexity and Statistical Physics

4 (2 ratings by Goodreads)
Edited by  , Edited by  , Edited by 

Free delivery worldwide

Available. Dispatched from the UK in 3 business days
When will my order arrive?


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 more

Product details

  • Hardback | 384 pages
  • 162 x 232 x 32mm | 698.54g
  • Oxford University Press Inc
  • New York, United States
  • English
  • New.
  • 84 halftones & line illus.
  • 0195177371
  • 9780195177374

About Allon Percus

Allon Percus is Associate Director of the Institute for Pure and Applied Mathematics at UCLA, and a scientist at Los Alamos National Laboratory. He received his Ph.D. in Theoretical Physics from the University of Paris, Orsay, in 1997. His research has combined statistical physics, discrete mathematics, and computer science, focusing primarily on local search algorithms in combinatorial optimization. He has organized numerous conferences and workshops on combinatorics, phase transitions, and algorithmic complexity. Gabriel Istrate is a scientist at Los Alamos National Laboratory, in the Basic and Applied Simulation Science group. He received his Ph.D. in Computer Science from the University of Rochester in 1999. His primary research interests are in combinatorial, game theoretic, and probabilistic aspects of complex systems. His work in the area of phase transitions has focused on the interplay between threshold properties and computational complexity. Cristopher Moore is an Associate Professor at the University of New Mexico, and holds a joint appointment in the Computer Science and Physics departments. He received his Ph.D. in Physics from Cornell University in 1991. He has published 80 papers at the interface between these two fields, on topics ranging from statistical physics and phase transitions to quantum algorithms and mapping the more

Review quote

"This volume provides a comprehensive overview of an exciting new research area at the interface between statistical physics and computer science. It is an excellent exposition, featuring state-of-the-art contributions by renowned researchers in the field. The book will serve as a useful reference for years to come." Bart Selman, Cornell Universityshow more

Table of contents

Preface ; Part 1: Fundamentals ; 1. Introduction: Where Statistical Physics Meets Computation ; 2. Threshold Phenomena and Influence: Perspectives from Mathematics, Computer Science, and Economics ; Part 2: Statistical Physics and Algorithms ; 3. Analyzing Search Algorithms with Physical Methods ; 4. Constraint Satisfaction by Survey Propagation ; 5. The Easiest Hard Problem: Number Partitioning ; 6. Ground States, Energy Landscape and Low-Temperature Dynamics of plus/minus Spin Glasses ; Part 3: Identifying the Threshold ; 7. The Satisfiability Threshold Conjecture: Techniques Behind Upper Bound Improvements ; 8. Proving Conditional Randomness Using the Principle of Deferred Decisions ; 9. The Phase Transition in the Random HornSAT Problem ; Part 4: Extensions and Applications ; 10. Phase Transitions for Quantum Search Algorithms ; 11. Scalability, Random Surfaces and Synchronized Computing Networks ; 12. Combinatorics of Genotype-Phenotype Maps: An RNA Case Study ; 13. Towards a Predictive Computational Complexity Theory for Periodically Specified Problems: A Survey ; Bibliography ; Indexshow more

Rating details

2 ratings
4 out of 5 stars
5 0% (0)
4 100% (2)
3 0% (0)
2 0% (0)
1 0% (0)
Book ratings by Goodreads
Goodreads is the world's largest site for readers with over 50 million reviews. We're featuring millions of their reader ratings on our book pages to help you find your new favourite book. Close X