Artículos relacionados a Combinatorics and Complexity of Partition Functions:...
Combinatorics and Complexity of Partition Functions: 30 (Algorithms and Combinatorics) - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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)
De la contraportada
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
- EditorialSpringer
- Año de publicación2018
- ISBN 10 3319847511
- ISBN 13 9783319847511
- EncuadernaciónTapa blanda
- IdiomaInglés
- Número de páginas312
- Contacto del fabricanteno disponible
Comprar nuevo
Ver este artículo
EUR 54,86
EUR 4,65 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Combinatorics and Complexity of Partition Functions:...
Imagen de archivo
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783319847511_new
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Combinatorics and Complexity of Partition Functions
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9783319847511
Cantidad disponible: 10 disponibles
Imagen del vendedor
Combinatorics and Complexity of Partition Functions
Publicado por
Springer International Publishing, 2018
ISBN 10: 3319847511
ISBN 13: 9783319847511
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
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: 448758671
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Combinatorics and Complexity of Partition Functions
Publicado por
Springer International Publishing Jul 2018, 2018
ISBN 10: 3319847511
ISBN 13: 9783319847511
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. 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: 9783319847511
Cantidad disponible: 2 disponibles
Imagen del vendedor
Combinatorics and Complexity of Partition Functions
Publicado por
Springer International Publishing, Springer International Publishing, 2018
ISBN 10: 3319847511
ISBN 13: 9783319847511
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. 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: 9783319847511
Cantidad disponible: 1 disponibles
Imagen de archivo
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)
Librería: dsmbooks, Liverpool, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: New. New. book. Nº de ref. del artículo: D8F0-0-M-3319847511-6
Cantidad disponible: 1 disponibles
Imagen del vendedor
Combinatorics and Complexity of Partition Functions
Publicado por
Springer International Publishing, Springer International Publishing Jul 2018, 2018
ISBN 10: 3319847511
ISBN 13: 9783319847511
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. 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: 9783319847511
Cantidad disponible: 2 disponibles
Imagen de archivo
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics (30))
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 309. Nº de ref. del artículo: 26384201133
Cantidad disponible: 4 disponibles
Imagen de archivo
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020109781
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics (30))
Impresión bajo demandaLibrería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Print on Demand pp. 309. Nº de ref. del artículo: 378654322
Cantidad disponible: 4 disponibles