Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cham :
Springer International Publishing : Imprint: Springer,
2016.
|
| Edición: | 1st ed. 2016. |
| Colección: | Algorithms and Combinatorics,
30 |
| Temas: | |
| Acceso en línea: | Texto Completo |
Tabla de Contenidos:
- Chapter I. Introduction
- Chapter II. Preliminaries
- Chapter III. Permanents
- Chapter IV. Hafnians and Multidimensional Permanents
- Chapter V. The Matching Polynomial
- Chapter VI. The Independence Polynomial
- Chapter VII. The Graph Homomorphism Partition Function
- Chapter VIII. Partition Functions of Integer Flows
- References
- Index.