Computational Complexity and Statistical Physics
Series: Santa Fe Institute Studies on the Sciences of Complexity;
- Publisher's listprice GBP 160.00
-
72 240 Ft (68 800 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 7 224 Ft off)
- Discounted price 65 016 Ft (61 920 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
72 240 Ft
Availability
printed on demand
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher OUP USA
- Date of Publication 15 December 2005
- ISBN 9780195177374
- Binding Hardback
- No. of pages384 pages
- Size 160x236x20 mm
- Weight 655 g
- Language English
- Illustrations 84 halftones & line illus. 0
Categories
Short description:
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.
MoreLong 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.
Table of Contents:
Preface
Part 1: Fundamentals
Introduction: Where Statistical Physics Meets Computation
Threshold Phenomena and Influence: Perspectives from Mathematics, Computer Science, and Economics
Part 2: Statistical Physics and Algorithms
Analyzing Search Algorithms with Physical Methods
Constraint Satisfaction by Survey Propagation
The Easiest Hard Problem: Number Partitioning
Ground States, Energy Landscape and Low-Temperature Dynamics of plus/minus Spin Glasses
Part 3: Identifying the Threshold
The Satisfiability Threshold Conjecture: Techniques Behind Upper Bound Improvements
Proving Conditional Randomness Using the Principle of Deferred Decisions
The Phase Transition in the Random HornSAT Problem
Part 4: Extensions and Applications
Phase Transitions for Quantum Search Algorithms
Scalability, Random Surfaces and Synchronized Computing Networks
Combinatorics of Genotype-Phenotype Maps: An RNA Case Study
Towards a Predictive Computational Complexity Theory for Periodically Specified Problems: A Survey
Bibliography
Index
