Taschenbuch. Etat : 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. N� de r�f. du vendeur 9783319847511

Contacter le vendeur

Acheter neuf

EUR 139,09

Autre devise

Frais de port : EUR 23

De Allemagne vers Etats-Unis

Destinations, frais et d�lais

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Combinatorics and Complexity of Partition Functions

Alexander Barvinok

Edit� par Springer International Publishing, 2018

ISBN 10 : 3319847511 ISBN 13 : 9783319847511

Neuf Couverture souple

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Contains an exposition of recent results&nbspDemonstrates a unified approach to hard algorithmic problemsProvides an easy to read introduction to statistical physics phenomena Contains an ex. N� de r�f. du vendeur 448758671

Contacter le vendeur

Acheter neuf

EUR 118,61

Autre devise

Frais de port : EUR 48,99

De Allemagne vers Etats-Unis

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Combinatorics and Complexity of Partition Functions

Alexander Barvinok

Edit� par Springer International Publishing, Springer International Publishing, 2018

ISBN 10 : 3319847511 ISBN 13 : 9783319847511

Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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. N� de r�f. du vendeur 9783319847511

Contacter le vendeur