Articles liés à Combinatorics and Complexity of Partition Functions
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
Alexander Barvinok is a professor of mathematics at the University of Michigan in Ann Arbor, interested in computational complexity and algorithms in algebra, geometry and combinatorics. The reader might be familiar with his books "A Course in Convexity" (AMS, 2002) and "Integer Points in Polyhedra" (EMS, 2008)
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
- ÉditeurSpringer International Publishing AG
- Date d'édition2017
- ISBN 10 3319518283
- ISBN 13 9783319518282
- ReliureRelié
- Langueanglais
- Numéro d'édition1
- Nombre de pages303
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 64,19
EUR 11 expédition depuis Allemagne vers France
Destinations, frais et délais
Résultats de recherche pour Combinatorics and Complexity of Partition Functions
Image fournie par le vendeur
Combinatorics and Complexity of Partition Functions
Edité par
Springer International Publishing Mrz 2017, 2017
ISBN 10 : 3319518283
ISBN 13 : 9783319518282
Neuf
Couverture rigide
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
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
Quantité disponible : 2 disponible(s)
Image d'archives
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783319518282_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Combinatorics and Complexity of Partition Functions 30 Algorithms and Combinatorics
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
Quantité disponible : 5 disponible(s)
Image fournie par le vendeur
Combinatorics and Complexity of Partition Functions
Edité par
Springer International Publishing, 2017
ISBN 10 : 3319518283
ISBN 13 : 9783319518282
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Gebunden. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Contains an exposition of recent results Demonstrates 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
Quantité disponible : Plus de 20 disponibles
Image d'archives
Combinatorics and Complexity of Partition Functions
impression à la demandeVendeur : 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
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Combinatorics and Complexity of Partition Functions
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
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Combinatorics and Complexity of Partition Functions
ISBN 10 : 3319518283
ISBN 13 : 9783319518282
Neuf
Couverture rigide
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. This item is printed on demand - Print on Demand Titel. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 312 pp. Englisch. N° de réf. du vendeur 9783319518282
Quantité disponible : 1 disponible(s)
Image d'archives
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9783319518282
Quantité disponible : Plus de 20 disponibles
Image d'archives
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020099320
Quantité disponible : Plus de 20 disponibles
Image d'archives
Combinatorics and Complexity of Partition Functions
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. N° de réf. du vendeur x-3319518283
Quantité disponible : 2 disponible(s)