Taschenbuch. Condizione: 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. Codice articolo 9783319847511

Contatta il venditore

Compra nuovo

EUR 139,09

Convertire valuta

Spese di spedizione: EUR 23,00

Da: Germania a: U.S.A.

Destinazione, tempi e costi

Quantit�: 2 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Combinatorics and Complexity of Partition Functions

Alexander Barvinok

Editore: Springer International Publishing, 2018

ISBN 10: 3319847511 ISBN 13: 9783319847511

Nuovo Brossura

Print on Demand

Da: moluna, Greven, Germania

Valutazione del venditore 5 su 5 stelle

Condizione: 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. Codice articolo 448758671

Contatta il venditore

Compra nuovo

EUR 118,61

Convertire valuta

Spese di spedizione: EUR 48,99

Da: Germania a: U.S.A.

Destinazione, tempi e costi

Quantit�: Pi� di 20 disponibili

Aggiungi al carrello

Immagini fornite dal venditore

Combinatorics and Complexity of Partition Functions

Alexander Barvinok

Editore: Springer International Publishing, Springer International Publishing, 2018

ISBN 10: 3319847511 ISBN 13: 9783319847511

Nuovo Taschenbuch

Da: AHA-BUCH GmbH, Einbeck, Germania

Valutazione del venditore 5 su 5 stelle

Taschenbuch. Condizione: 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. Codice articolo 9783319847511

Contatta il venditore