Articoli correlati a Combinatorics and Complexity of Partition Functions:...
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Recensione
“The book is aimed at graduate students and researchers in theoretical computer science, combinatorics and statistical physics. ... The author has the ability to make complicated proofs very accessible while not sacrificing any mathematical rigour, making it a pleasure to read. ... The book also moves from the particular to the general ... . An advantage of this is that it makes it easier to understand the key ideas.” (Guus Regts, Mathematical Reviews, August, 2018)
L'autore
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)
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreSpringer Nature
- Data di pubblicazione2017
- ISBN 10 3319518283
- ISBN 13 9783319518282
- RilegaturaCopertina rigida
- LinguaInglese
- Numero edizione1
- Numero di pagine303
Compra nuovo
Visualizza questo articolo
EUR 71,66
EUR 14,09 per la spedizione da Regno Unito a U.S.A.
Destinazione, tempi e costi
Risultati della ricerca per Combinatorics and Complexity of Partition Functions:...
Foto dell'editore
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783319518282_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Combinatorics and Complexity of Partition Functions
Editore:
Springer International Publishing Mrz 2017, 2017
ISBN 10: 3319518283
ISBN 13: 9783319518282
Nuovo
Rilegato
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Buch. 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 9783319518282
Quantità: 2 disponibili
Immagini fornite dal venditore
Combinatorics and Complexity of Partition Functions
Editore:
Springer International Publishing, 2017
ISBN 10: 3319518283
ISBN 13: 9783319518282
Nuovo
Rilegato
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. 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 9783319518282
Quantità: 1 disponibili
Foto dell'editore
Combinatorics and Complexity of Partition Functions 30 Algorithms and Combinatorics
Editore:
Springer International Publishing, 2017
ISBN 10: 3319518283
ISBN 13: 9783319518282
Nuovo
Rilegato
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 4 su 5 stelle
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo S0-9783319518282
Quantità: 5 disponibili
Foto dell'editore
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar3113020099320
Quantità: Più di 20 disponibili
Foto dell'editore
Combinatorics and Complexity of Partition Functions
Print on DemandDa: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Brand New. 303 pages. 9.25x6.25x0.75 inches. In Stock. This item is printed on demand. Codice articolo __3319518283
Quantità: 2 disponibili
Foto dell'editore
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9783319518282
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Combinatorics and Complexity of Partition Functions
Editore:
Springer International Publishing, 2017
ISBN 10: 3319518283
ISBN 13: 9783319518282
Nuovo
Rilegato
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 Demonstrates a unified approach to hard algorithmic problemsProvides an easy to read introduction to statistical physics phenomena Contains an ex. Codice articolo 135466928
Quantità: Più di 20 disponibili
Foto dell'editore
Combinatorics and Complexity of Partition Functions
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Brand New. 303 pages. 9.25x6.25x0.75 inches. In Stock. Codice articolo x-3319518283
Quantità: 2 disponibili