Combinatorics and Complexity of Partition Functions
Produktnummer:
18b12e1612388a4224942c123c22be9db6
| Autor: | Barvinok, Alexander |
|---|---|
| Themengebiete: | algorithms complexity correlation decay graph homomorphism independence polynomial integer flow mathing polynomial partition function permanent stable polynomials |
| Veröffentlichungsdatum: | 18.07.2018 |
| EAN: | 9783319847511 |
| Sprache: | Englisch |
| Seitenzahl: | 303 |
| Produktart: | Kartoniert / Broschiert |
| Verlag: | Springer International Publishing |
Produktinformationen "Combinatorics and Complexity of Partition Functions"
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.
Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen