Das Buch ist derzeit nicht auf Lager
Mehr zum Buch
Focusing on computational techniques, the book delves into partition functions that play a crucial role in combinatorics and statistical physics. It explores efficient methods for approximating various partition functions, including permanents, hafnians, and higher-dimensional analogs, as well as graph and hypergraph matching polynomials. The text also covers the independence polynomial of graphs and partition functions that enumerate points in polyhedra, aiming to provide algorithmic solutions to complex and previously intractable problems.
Buchkauf
Combinatorics and Complexity of Partition Functions, Alexander Barvinok
- Sprache
- Erscheinungsdatum
- 2017
- product-detail.submit-box.info.binding
- (Hardcover)
Wir benachrichtigen dich per E-Mail.
Lieferung
Zahlungsmethoden
Feedback senden
- Titel
- Combinatorics and Complexity of Partition Functions
- Sprache
- Englisch
- Autor*innen
- Alexander Barvinok
- Erscheinungsdatum
- 2017
- Einband
- Hardcover
- Seitenzahl
- 312
- ISBN13
- 9783319518282
- Kategorie
- Mathematik, Informatik & Programmierung
- Beschreibung
- Focusing on computational techniques, the book delves into partition functions that play a crucial role in combinatorics and statistical physics. It explores efficient methods for approximating various partition functions, including permanents, hafnians, and higher-dimensional analogs, as well as graph and hypergraph matching polynomials. The text also covers the independence polynomial of graphs and partition functions that enumerate points in polyhedra, aiming to provide algorithmic solutions to complex and previously intractable problems.