Combinatorics and Complexity of Partition Functions
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, hafnia...
| Main Author: | Barvinok, Alexander (Author) |
|---|---|
| Corporate Author: | SpringerLink (Online service) |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cham :
Springer International Publishing : Imprint: Springer,
2016.
|
| Series: | Algorithms and Combinatorics,
30 |
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Similar Items
-
Discrete Calculus Methods for Counting /
by: Mariconda, Carlo, et al.
Published: (2016) -
Current Topics in Pure and Computational Complex Analysis
Published: (2014) -
Mixed Integer Nonlinear Programming
Published: (2012) -
Approximation Algorithms for Complex Systems Proceedings of the 6th International Conference on Algorithms for Approximation, Ambleside, UK, 31st August - 4th September 2009 /
Published: (2011) -
Zeta Functions over Zeros of Zeta Functions
by: Voros, André
Published: (2010)