Librería:
Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 25 de marzo de 2015
In. N° de ref. del artículo ria9783319518282_new
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.
Acerca del autor:
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)
Título: Combinatorics and Complexity of Partition ...
Editorial: Springer
Año de publicación: 2017
Encuadernación: Encuadernación de tapa dura
Condición: New
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Buch. Condición: 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 ref. del artículo: 9783319518282
Cantidad disponible: 2 disponibles
Librería: Brook Bookstore, Milano, MI, Italia
Condición: new. Nº de ref. del artículo: 492d84ff7c8bad840bc4243346e7eac4
Cantidad disponible: 5 disponibles
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
Condición: new. Nº de ref. del artículo: 492d84ff7c8bad840bc4243346e7eac4
Cantidad disponible: 5 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: S0-9783319518282
Cantidad disponible: 5 disponibles
Librería: moluna, Greven, Alemania
Gebunden. Condición: 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 ref. del artículo: 135466928
Cantidad disponible: Más de 20 disponibles
Librería: preigu, Osnabrück, Alemania
Buch. Condición: Neu. Combinatorics and Complexity of Partition Functions | Alexander Barvinok | Buch | vi | Englisch | 2017 | Springer International Publishing | EAN 9783319518282 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 108731244
Cantidad disponible: 5 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Hardcover. Condición: Brand New. 303 pages. 9.25x6.25x0.75 inches. In Stock. This item is printed on demand. Nº de ref. del artículo: __3319518283
Cantidad disponible: 2 disponibles
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020099320
Cantidad disponible: Más de 20 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Buch. Condición: 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 ref. del artículo: 9783319518282
Cantidad disponible: 1 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Buch. Condición: 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 ref. del artículo: 9783319518282
Cantidad disponible: 1 disponibles