Produktart
Zustand
Einband
Weitere Eigenschaften
Land des Verkäufers
Verkäuferbewertung
Verlag: Springer, 2017
ISBN 10: 3319518283ISBN 13: 9783319518282
Anbieter: SpringBooks, Berlin, Deutschland
Buch Erstausgabe
Hardcover. Zustand: As New. 1. Auflage. unread, like new - will be dispatched immediately.
Verlag: Springer International Publishing, 2018
ISBN 10: 3319847511ISBN 13: 9783319847511
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Taschenbuch. Zustand: 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.
Verlag: Springer International Publishing, 2017
ISBN 10: 3319518283ISBN 13: 9783319518282
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
Buch. Zustand: 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.