Combinatorics and Complexity of Partition Functions

by Alexander Barvinok

No Customer Reviews

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

Format:Hardcover

Language:English

ISBN:3319518283

ISBN13:9783319518282

Release Date:March 2017

Publisher:Springer

Length:303 Pages

Weight:1.35 lbs.

Dimensions:0.8" x 6.1" x 9.2"

Related Subjects

Computers Computers & Technology Math Mathematics Science & Math

Customer Reviews

0 rating

Write a review

ThriftBooks sells millions of used books at the lowest everyday prices. We personally assess every book's quality and offer rare, out-of-print treasures. We deliver the joy of reading in recyclable packaging with free standard shipping on US orders over $15. ThriftBooks.com. Read more. Spend less.

Copyright © 2024 Thriftbooks.com Terms of Use | Privacy Policy | Do Not Sell/Share My Personal Information | Cookie Policy | Cookie Preferences | Accessibility Statement
ThriftBooks^® and the ThriftBooks^® logo are registered trademarks of Thrift Books Global, LLC

Combinatorics and Complexity of Partition Functions

Recommended

Customer Reviews

Popular Categories

Website

My Account

Partnerships

Quick Help

About Us

Follow Us