Buch. 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 9783319518282

Contacter le vendeur

Acheter neuf

EUR 64,19

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, 2017

ISBN 10 : 3319518283 ISBN 13 : 9783319518282

Neuf Couverture rigide

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Buch. 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 9783319518282

Contacter le vendeur

Acheter neuf

EUR 64,19

Autre devise

Frais de port : EUR 31,17

De Allemagne vers Etats-Unis

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Combinatorics and Complexity of Partition Functions 30 Algorithms and Combinatorics

Alexander Barvinok

Edit� par Springer International Publishing, 2017

ISBN 10 : 3319518283 ISBN 13 : 9783319518282

Neuf Couverture rigide

Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni

�valuation du vendeur 4 sur 5 �toiles

HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000. N� de r�f. du vendeur S0-9783319518282

Contacter le vendeur

Acheter neuf

EUR 118,88

Autre devise

Frais de port : EUR 5,91

De Royaume-Uni vers Etats-Unis

Destinations, frais et d�lais

Quantit� disponible : 5 disponible(s)

Ajouter au panier

Image d'archives

Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)

Barvinok, Alexander

Edit� par Springer, 2017

ISBN 10 : 3319518283 ISBN 13 : 9783319518282

Neuf Couverture rigide

Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis

�valuation du vendeur 5 sur 5 �toiles

Etat : New. N� de r�f. du vendeur ABLIING23Mar3113020099320

Contacter le vendeur

Acheter neuf

EUR 133,56

Autre devise

Frais de port : EUR 3,50

Vers Etats-Unis

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Combinatorics and Complexity of Partition Functions

Barvinok, Alexander (Author)

Edit� par Springer, 2017

ISBN 10 : 3319518283 ISBN 13 : 9783319518282

Neuf Couverture rigide

impression � la demande

Vendeur : Revaluation Books, Exeter, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Hardcover. Etat : Brand New. 303 pages. 9.25x6.25x0.75 inches. In Stock. This item is printed on demand. N� de r�f. du vendeur __3319518283

Contacter le vendeur

Acheter neuf

EUR 133,42

Autre devise

Frais de port : EUR 11,78

De Royaume-Uni vers Etats-Unis

Destinations, frais et d�lais

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)

Barvinok, Alexander

Edit� par Springer, 2017

ISBN 10 : 3319518283 ISBN 13 : 9783319518282

Neuf Couverture rigide

Vendeur : California Books, Miami, FL, Etats-Unis

�valuation du vendeur 5 sur 5 �toiles

Etat : New. N� de r�f. du vendeur I-9783319518282

Contacter le vendeur

Acheter neuf

EUR 164,32

Autre devise

Frais de port : Gratuit

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, 2017

ISBN 10 : 3319518283 ISBN 13 : 9783319518282

Neuf Couverture rigide

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 135466928

Contacter le vendeur