Stock image for illustration purposes only - book cover, edition or condition may vary.
Combinatorics and Complexity of Partition Functions
Alexander Barvinok
€ 150.98
FREE Delivery in Ireland
Description for Combinatorics and Complexity of Partition Functions
Hardback. Series: Algorithms and Combinatorics. Num Pages: 303 pages, 9 black & white illustrations, 42 colour illustrations, biography. BIC Classification: PBD; PBKJ; PBKS; PBV; PHS. Category: (P) Professional & Vocational. Dimension: 235 x 155. .
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 ... Read more
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 ... Read more
Product Details
Publisher
Springer International Publishing AG
Format
Hardback
Publication date
2017
Series
Algorithms and Combinatorics
Condition
New
Weight
28g
Number of Pages
303
Place of Publication
Cham, Switzerland
ISBN
9783319518282
SKU
V9783319518282
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
About Alexander Barvinok
Alexander Barvinok is a professor of mathematics at the University of Michigan in Ann Arbor, interested in computational complexity and algorithms in algebra, geometry and combinatorics. The reader might be familiar with his books A Course in Convexity (AMS, 2002) and Integer Points in Polyhedra (EMS, 2008)
Reviews for Combinatorics and Complexity of Partition Functions
The book is aimed at graduate students and researchers in theoretical computer science, combinatorics and statistical physics. ... The author has the ability to make complicated proofs very accessible while not sacrificing any mathematical rigour, making it a pleasure to read. ... The book also moves from the particular to the general ... . An advantage of this is that ... Read more