Computational Complexity and Statistical Physics (Santa Fe Institute Studies on the Sciences of Complexity) / Percus, Allon (EDT)/ Istrate, Gabriel (EDT)/ Moore, Cristopher (EDT)

計算複雑性と統計物理学<br>Computational Complexity and Statistical Physics (Santa Fe Institute Studies on the Sciences of Complexity)

個数：

計算複雑性と統計物理学
Computational Complexity and Statistical Physics (Santa Fe Institute Studies on the Sciences of Complexity)

Percus, Allon (EDT)/ Istrate, Gabriel (EDT)/ Moore, Cristopher (EDT)

ウェブストア価格 ¥58,854（本体¥53,504）
Oxford University Press Inc（2005/12発売）
外貨定価 US$ 275.00
ポイント 535pt

提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
【重要ご説明事項】
1. 納期遅延や、ご入手不能となる場合が若干ございます。
2. 複数冊ご注文の場合は、ご注文数量が揃ってからまとめて発送いたします。
3. 美品のご指定は承りかねます。

●3Dセキュア導入とクレジットカードによるお支払いについて

【入荷遅延について】
世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。

◆画像の表紙や帯等は実物とは異なる場合があります。

◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
また、洋書販売価格は、ご注文確定時点での日本円価格となります。
ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。

製本 Hardcover:ハードカバー版／ページ数 384 p.
言語 ENG
商品コード 9780195177374
DDC分類 511.352

基本説明

Intended to be a standard reference to statistical physics methods in computer science theory, particularly in relation to the study of phase transitions in combinatorial problems.

Full 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.

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 ; Index