Items related to Combinatorics and Complexity of Partition Functions...
Synopsis
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 three main approaches: scaling, interpolation and correlation decay. The prerequisites include moderate amounts of real and complex analysis and linear algebra, making the book accessible to advanced math and physics undergraduates.
"synopsis" may belong to another edition of this title.
About the Author
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)
Review
“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 it makes it easier to understand the key ideas.” (Guus Regts, Mathematical Reviews, August, 2018)
"About this title" may belong to another edition of this title.
- PublisherSpringer
- Publication date2018
- ISBN 10 3319847511
- ISBN 13 9783319847511
- BindingPaperback
- LanguageEnglish
- Number of pages309
Buy New
View this item
US$ 62.56
US$ 15.95 shipping from United Kingdom to U.S.A.
Destination, rates & speeds
Search results for Combinatorics and Complexity of Partition Functions...
Stock Image
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783319847511_new
Quantity: Over 20 available
Stock Image
Combinatorics and Complexity of Partition Functions
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783319847511
Quantity: 10 available
Stock Image
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020109781
Quantity: Over 20 available
Stock Image
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)
Seller: dsmbooks, Liverpool, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: New. New. book. Seller Inventory # D8F0-0-M-3319847511-6
Quantity: 1 available
Seller Image
Combinatorics and Complexity of Partition Functions
Published by
Springer International Publishing Jul 2018, 2018
ISBN 10: 3319847511
ISBN 13: 9783319847511
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 three main approaches: scaling, interpolation and correlation decay.The prerequisites include moderate amounts of real and complex analysis and linear algebra, making the book accessible to advanced math and physics undergraduates. 312 pp. Englisch. Seller Inventory # 9783319847511
Quantity: 2 available
Seller Image
Combinatorics and Complexity of Partition Functions
Published by
Springer International Publishing, 2018
ISBN 10: 3319847511
ISBN 13: 9783319847511
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Contains an exposition of recent results Demonstrates a unified approach to hard algorithmic problemsProvides an easy to read introduction to statistical physics phenomena Contains an ex. Seller Inventory # 448758671
Quantity: Over 20 available
Seller Image
Combinatorics and Complexity of Partition Functions
Published by
Springer International Publishing, Springer International Publishing, 2018
ISBN 10: 3319847511
ISBN 13: 9783319847511
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 three main approaches: scaling, interpolation and correlation decay.The prerequisites include moderate amounts of real and complex analysis and linear algebra, making the book accessible to advanced math and physics undergraduates. Seller Inventory # 9783319847511
Quantity: 1 available
Stock Image
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics (30))
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Print on Demand pp. 309. Seller Inventory # 378654322
Quantity: 4 available
Stock Image
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics (30))
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 309. Seller Inventory # 18384201127
Quantity: 4 available