Combinatorics and Complexity of Partition Functions(Algorithms and Combinatorics)

应用数学

原   价:
498.00
售   价:
398.00
优惠
平台大促 低至8折优惠
发货周期:国外库房发货,通常付款后3-5周到货!
出  版 社
出版时间
2018年07月18日
装      帧
ISBN
9783319847511
复制
页      码
303
开      本
23.4 x 15.6 x 1.7 cm
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个