Combinatorics and Complexity of Partition Functions

Combinatorics and Complexity of Partition Functions by Alexander Barvinok.

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

Full description

Saved in:
Bibliographic Details
Main Author: Barvinok, Alexander (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2016.
Edition:1st ed. 2016.
Series:Algorithms and Combinatorics, 30
Springer eBook Collection.
Subjects:
Algorithms.
Combinatorics.
Computer science—Mathematics.
Statistical physics.
Dynamical systems.
Approximation theory.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Login for hold information

‌

Click to view e-book

Online

Holdings details from Online
Call Number: E-Book
Status: Available

Similar Items