Del 30 i serien Algorithms and Combinatorics
Combinatorics and Complexity of Partition Functions
Inbunden, Engelska, 2017
1 859 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.
Finns i fler format (1)
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.
Produktinformation
- Utgivningsdatum2017-03-21
- Mått155 x 235 x 23 mm
- Vikt635 g
- FormatInbunden
- SpråkEngelska
- SerieAlgorithms and Combinatorics
- Antal sidor303
- Upplaga17001
- FörlagSpringer International Publishing AG
- ISBN9783319518282
Tillhör följande kategorier
Hoppa över listan
Mer från samma serie
Del 29
Del 29
Del 3
Topics in Discrete Mathematics
Martin Klazar, Jan Kratochvil, Martin Loebl, Robin Thomas, Pavel Valtr
Inbunden, 2006
2 149 kr
Del 22
Del 15
Hoppa över listan
Du kanske också är intresserad av
Del 30
Topics in Discrete Mathematics
Martin Klazar, Jan Kratochvil, Martin Loebl, Robin Thomas, Pavel Valtr
Inbunden, 2006
2 149 kr
Del 29
Del 19