• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Combinatorics and Complexity of Partition Functions

Combinatorics and Complexity of Partition Functions

Hardcover

Series: Algorithms and Combinatorics, Book 30

General ComputersGeneral Mathematics

ISBN10: 3319518283
ISBN13: 9783319518282
Publisher: Springer
Published: Mar 21 2017
Pages: 303
Weight: 1.35
Height: 0.75 Width: 6.14 Depth: 9.21
Language: 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.

1 different editions

Also available

Also from

Barvinok, Alexander

Also in

General Computers