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)
From the Back Cover
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.
"About this title" may belong to another edition of this title.
- PublisherSpringer
- Publication date2017
- ISBN 10 3319518283
- ISBN 13 9783319518282
- BindingHardcover
- LanguageEnglish
- Edition number1
- Number of pages309
Buy New
View this item
US$ 82.27
US$ 16.18 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 # ria9783319518282_new
Quantity: Over 20 available
Seller Image
Combinatorics and Complexity of Partition Functions
Published by
Springer International Publishing Mrz 2017, 2017
ISBN 10: 3319518283
ISBN 13: 9783319518282
New
Hardcover
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. 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 # 9783319518282
Quantity: 2 available
Stock Image
Combinatorics and Complexity of Partition Functions 30 Algorithms and Combinatorics
Published by
Springer International Publishing, 2017
ISBN 10: 3319518283
ISBN 13: 9783319518282
New
Hardcover
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # S0-9783319518282
Quantity: 5 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 # ABLIING23Mar3113020099320
Quantity: Over 20 available
Stock Image
Combinatorics and Complexity of Partition Functions
Print on DemandSeller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Brand New. 303 pages. 9.25x6.25x0.75 inches. In Stock. This item is printed on demand. Seller Inventory # __3319518283
Quantity: 2 available
Stock Image
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9783319518282
Quantity: Over 20 available
Seller Image
Combinatorics and Complexity of Partition Functions
Published by
Springer International Publishing, 2017
ISBN 10: 3319518283
ISBN 13: 9783319518282
New
Hardcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Gebunden. 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 # 135466928
Quantity: Over 20 available
Seller Image
Combinatorics and Complexity of Partition Functions
Published by
Springer International Publishing, Springer International Publishing, 2017
ISBN 10: 3319518283
ISBN 13: 9783319518282
New
Hardcover
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. 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 # 9783319518282
Quantity: 1 available
Seller Image
Combinatorics and Complexity of Partition Functions
ISBN 10: 3319518283
ISBN 13: 9783319518282
New
Hardcover
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. This item is printed on demand - Print on Demand Titel. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 312 pp. Englisch. Seller Inventory # 9783319518282
Quantity: 1 available
Stock Image
Combinatorics and Complexity of Partition Functions
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Brand New. 303 pages. 9.25x6.25x0.75 inches. In Stock. Seller Inventory # x-3319518283
Quantity: 2 available