Share
Combinatorics and Complexity of Partition Functions (in English)
Alexander Barvinok
(Author)
·
Springer
· Paperback
Combinatorics and Complexity of Partition Functions (in English) - Barvinok, Alexander
$ 132.62
$ 139.99
You save: $ 7.37
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My WishlistsIt will be shipped from our warehouse between
Wednesday, June 12 and
Thursday, June 13.
You will receive it anywhere in United States between 1 and 3 business days after shipment.
Synopsis "Combinatorics and Complexity of Partition Functions (in English)"
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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.
✓ Producto agregado correctamente al carro, Ir a Pagar.
