Skip to main content alibris logo

Combinatorics and Complexity of Partition Functions

by

Write The First Customer Review
Combinatorics and Complexity of Partition Functions - Barvinok, Alexander
Filter Results
Item Condition
Seller Rating
Other Options
Change Currency

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 ...

loading
Combinatorics and Complexity of Partition Functions 2018, Springer, Cham

ISBN-13: 9783319847511

Trade paperback

Combinatorics and Complexity of Partition Functions 2017, Springer, Cham

ISBN-13: 9783319518282

2016 edition

Hardcover