| 书目名称 | Combinatorics and Complexity of Partition Functions |
| 编辑 | Alexander Barvinok |
| 视频video | http://file.papertrans.cn/231/230042/230042.mp4 |
| 概述 | Contains an exposition of recent results.Demonstrates a unified approach to hard algorithmic problems.Provides an easy to read introduction to statistical physics phenomena.Includes supplementary mate |
| 丛书名称 | Algorithms and Combinatorics |
| 图书封面 |  |
| 描述 | .Partition functions arise in combinatorics and related problems of statistical physics as they encode in a succinct way the combinatorial structure of complicated systems. The main focus of the book is on efficient ways to compute (approximate) various partition functions, such as permanents, hafnians and their higher-dimensional versions, graph and hypergraph matching polynomials, the independence polynomial of a graph and partition functions enumerating 0-1 and integer points in polyhedra, which allows one to make algorithmic advances in otherwise intractable problems. .The book unifies various, often quite recent, results scattered in the literature, concentrating on the three main approaches: scaling, interpolation and correlation decay. The prerequisites include moderate amounts of real and complex analysis and linear algebra, making the book accessible to advanced math and physics undergraduates. . |
| 出版日期 | Book 2016 |
| 关键词 | algorithms; complexity; partition function; permanent; mathing polynomial; independence polynomial; graph |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-319-51829-9 |
| isbn_softcover | 978-3-319-84751-1 |
| isbn_ebook | 978-3-319-51829-9Series ISSN 0937-5511 Series E-ISSN 2197-6783 |
| issn_series | 0937-5511 |
| copyright | Springer International Publishing AG 2016 |
|Archiver|手机版|小黑屋|
派博传思国际
( 京公网安备110108008328)
GMT+8, 2025-8-24 17:16
发表于 2025-3-21 18:17:25
