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: | Barvinok, Alexander (Autor) |
| Autor Corporativo: | SpringerLink (Online service) |
| 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 |
Ejemplares similares
-
Approximation Algorithms and Semidefinite Programming
por: Gärtner, Bernd, et al.
Publicado: (2012) -
Discrete Calculus Methods for Counting /
por: Mariconda, Carlo, et al.
Publicado: (2016) -
Structural Analysis of Complex Networks
Publicado: (2011) -
Media Theory Interdisciplinary Applied Mathematics /
por: Eppstein, David, et al.
Publicado: (2008) -
Introduction to Calculus and Classical Analysis
por: Hijab, Omar
Publicado: (2016)


