Show Summary Details
- Title Pages
- About the Santa Fe Institute
- Santa Fe Institute Editorial Board
- Contributors List
- Preface
- Chapter 1 Introduction: Where Statistical Physics Meets Computation
- Chapter 2 Threshold Phenomena and Influence: Perspectives from Mathematics, Computer Science, and Economics
- Chapter 3 Analyzing Search Algorithms with Physical Methods
- Chapter 4 Constraint Satisfaction by Survey Propagation
- Chapter 5 The Easiest Hard Problem: Number Partitioning
- Chapter 6 Ground States, Energy Landscape, and Low-Temperature Dynamics of ± <i>J</i> Spin Glasses
- Chapter 7 The Satisfiability Threshold Conjecture: Techniques Behind Upper Bound Improvements
- Chapter 8 Proving Conditional Randomness using the Principle of Deferred Decisions
- Chapter 9 The Phase Transition in the Random HornSAT Problem
- Chapter 10 Phase Transitions for Quantum Search Algorithms
- Chapter 11 Scalability, Random Surfaces, and Synchronized Computing Networks
- Chapter 12 Combinatorics of Genotype-Phenotype Maps: An RNA Case Study
- Chapter 13 Towards a Predictive Computational Complexity Theory for Periodically Specified Problems: A Survey
- Bibliography
- Index
About the Santa Fe Institute
About the Santa Fe Institute
- Source:
- Computational Complexity and Statistical Physics
- Author(s):
- Allon Percus, Gabriel Istrate, Cristopher Moore
- Publisher:
- Oxford University Press
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
Please, subscribe or login to access full text content.
If you think you should have access to this title, please contact your librarian.
To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .
- Title Pages
- About the Santa Fe Institute
- Santa Fe Institute Editorial Board
- Contributors List
- Preface
- Chapter 1 Introduction: Where Statistical Physics Meets Computation
- Chapter 2 Threshold Phenomena and Influence: Perspectives from Mathematics, Computer Science, and Economics
- Chapter 3 Analyzing Search Algorithms with Physical Methods
- Chapter 4 Constraint Satisfaction by Survey Propagation
- Chapter 5 The Easiest Hard Problem: Number Partitioning
- Chapter 6 Ground States, Energy Landscape, and Low-Temperature Dynamics of ± <i>J</i> Spin Glasses
- Chapter 7 The Satisfiability Threshold Conjecture: Techniques Behind Upper Bound Improvements
- Chapter 8 Proving Conditional Randomness using the Principle of Deferred Decisions
- Chapter 9 The Phase Transition in the Random HornSAT Problem
- Chapter 10 Phase Transitions for Quantum Search Algorithms
- Chapter 11 Scalability, Random Surfaces, and Synchronized Computing Networks
- Chapter 12 Combinatorics of Genotype-Phenotype Maps: An RNA Case Study
- Chapter 13 Towards a Predictive Computational Complexity Theory for Periodically Specified Problems: A Survey
- Bibliography
- Index
