Open AccessBook
Computational Complexity and Statistical Physics
Allon G. Percus,Gabriel Istrate,Cristopher Moore +2 more
- 23 Feb 2006
175
TL;DR: 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.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Information, Physics, and Computation
Marc Mézard,Andrea Montanari +1 more
- 27 Mar 2009
TL;DR: The approach focuses on large random instances, adopting a common probabilistic formulation in terms of graphical models, and presents message passing algorithms like belief propagation and survey propagation, and their use in decoding and constraint satisfaction solving.
2K
The Nature of Computation
Cristopher Moore,Stephan Mertens +1 more
- 09 Oct 2011
TL;DR: The authors explain why the P vs. NP problem is so fundamental, and why it is so hard to resolve, and lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing.
476
Optimized Product Quantization
TL;DR: This paper optimize PQ by minimizing quantization distortions w.r.t the space decomposition and the quantization codebooks, and evaluates the optimized product quantizers in three applications: compact encoding for exhaustive ranking, inverted multi-indexing for non-exhaustive search, and compacting image representations for image retrieval.
The self-dual point of the two-dimensional random-cluster model is critical for q ≥ 1
TL;DR: In this paper, it was shown that the critical temperature of the q-state Potts model with parameter q ≥ 1 on the square lattice is equal to the self-dual point.
A Brief Introduction to Fourier Analysis on the Boolean Cube.
TL;DR: A brief introduction to the basic notions of Fourier analysis on the Boolean cube is given, illustrated and motivated by a number of applications to theoretical computer science.
Related Papers (5)
Jeff Kahn,Gil Kalai,Nathan Linial +2 more
- 24 Oct 1988