Order Total (1 Item Items):
Shipping Destination:
Combinatorics Complexity Partition Functions by Barvinok Alexander (19 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (19)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition
- All Conditions
- New (19)
- Used (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (6)
- Not Print on Demand (12)
Language (1)
Price
- Any Price
- Under US$ 25 (No further results match this refinement)
- US$ 25 to US$ 50 (No further results match this refinement)
- Over US$ 50
Free Shipping
Seller Location
Seller Rating
-
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 62.77
Convert currencyUS$ 16.00 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Combinatorics and Complexity of Partition Functions (Algorithms and Combinatorics, 30)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 81.37
Convert currencyUS$ 16.00 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
US$ 105.44
Convert currencyUS$ 20.69 shipping from United Kingdom to U.S.A.Quantity: 10 available
Add to basketPF. Condition: New.
-
Combinatorics and Complexity of Partition Functions 30 Algorithms and Combinatorics
Published by Springer International Publishing, 2017
ISBN 10: 3319518283 ISBN 13: 9783319518282
Language: English
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
US$ 134.85
Convert currencyUS$ 6.71 shipping from United Kingdom to U.S.A.Quantity: 5 available
Add to basketHRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
US$ 147.47
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
US$ 147.93
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
US$ 136.62
Convert currencyUS$ 33.40 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: New. New. book.
-
Condition: New.
-
Combinatorics and Complexity of Partition Functions
Published by Springer International Publishing, Springer International Publishing, 2018
ISBN 10: 3319847511 ISBN 13: 9783319847511
Language: English
US$ 160.92
Convert currencyUS$ 34.11 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketTaschenbuch. Condition: 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.
-
Combinatorics and Complexity of Partition Functions
Published by Springer International Publishing, Springer International Publishing, 2017
ISBN 10: 3319518283 ISBN 13: 9783319518282
Language: English
US$ 160.92
Convert currencyUS$ 35.01 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketBuch. Condition: 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.
-
Condition: New. pp. 309.
-
US$ 227.90
Convert currencyUS$ 13.36 shipping from United Kingdom to U.S.A.Quantity: 2 available
Add to basketHardcover. Condition: Brand New. 303 pages. 9.25x6.25x0.75 inches. In Stock.
-
Combinatorics and Complexity of Partition Functions
Published by Springer International Publishing Mrz 2017, 2017
ISBN 10: 3319518283 ISBN 13: 9783319518282
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
US$ 74.27
Convert currencyUS$ 25.83 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketBuch. Condition: 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.
-
US$ 151.34
Convert currencyUS$ 13.36 shipping from United Kingdom to U.S.A.Quantity: 2 available
Add to basketHardcover. Condition: Brand New. 303 pages. 9.25x6.25x0.75 inches. In Stock. This item is printed on demand.
-
Combinatorics and Complexity of Partition Functions
Published by Springer International Publishing Jul 2018, 2018
ISBN 10: 3319847511 ISBN 13: 9783319847511
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
US$ 160.92
Convert currencyUS$ 25.83 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketTaschenbuch. Condition: 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.
-
Combinatorics and Complexity of Partition Functions
Published by Springer International Publishing, 2018
ISBN 10: 3319847511 ISBN 13: 9783319847511
Language: English
US$ 137.23
Convert currencyUS$ 55.03 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketCondition: 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.
-
Combinatorics and Complexity of Partition Functions
Published by Springer International Publishing, 2017
ISBN 10: 3319518283 ISBN 13: 9783319518282
Language: English
US$ 137.23
Convert currencyUS$ 55.03 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketCondition: 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.
-
US$ 218.99
Convert currencyUS$ 8.68 shipping from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: New. Print on Demand pp. 309.
-
US$ 234.87
Convert currencyUS$ 11.18 shipping from Germany to U.S.A.Quantity: 4 available
Add to basketCondition: New. PRINT ON DEMAND pp. 309.
