Order Total (1 Item Items):
Shipping Destination:
Combinatorics Complexity Partition Functions by Barvinok Alexander (35 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (35)
- 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 Learn more
- New (33)
- As New, Fine or Near Fine (2)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (2)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (16)
- Not Print on Demand (24)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Condition: As New. Unread book in perfect condition.
-
Condition: New.
-
Combinatorics and Complexity of Partition Functions
Published by Springer International Publishing AG, CH, 2018
ISBN 10: 3319847511 ISBN 13: 9783319847511
Language: English
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
US$ 73.98
Free Shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback. Condition: New. 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. Softcover reprint of the original 1st ed. 2016.
-
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$ 60.32
US$ 15.84 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
US$ 57.91
US$ 20.48 shipping
Ships from United Kingdom to U.S.A.Quantity: 10 available
Add to basketPaperback. Condition: New.
-
Combinatorics and Complexity of Partition Functions
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 60.31
US$ 19.83 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Combinatorics and Complexity of Partition Functions
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 67.63
US$ 19.83 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
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$ 78.02
US$ 15.84 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Combinatorics and Complexity of Partition Functions
Published by Springer International Publishing, 2017
ISBN 10: 3319518283 ISBN 13: 9783319518282
Language: English
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
US$ 132.14
US$ 6.64 shipping
Ships from United Kingdom to U.S.A.Quantity: 5 available
Add to basketHRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
Condition: new.
-
-
-
Combinatorics and Complexity of Partition Functions
Published by Springer International Publishing AG, CH, 2018
ISBN 10: 3319847511 ISBN 13: 9783319847511
Language: English
US$ 69.72
US$ 85.93 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback. Condition: New. 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. Softcover reprint of the original 1st ed. 2016.
-
Condition: new.
-
-
Combinatorics and Complexity of Partition Functions (Hardcover)
Published by Springer International Publishing AG, Cham, 2017
ISBN 10: 3319518283 ISBN 13: 9783319518282
Language: English
First Edition
Hardcover. Condition: new. Hardcover. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Condition: New. pp. 309.
-
Condition: New. 1st ed. 2016 edition NO-PA16APR2015-KAP.
-
Combinatorics and Complexity of Partition Functions
Published by Springer International Publishing, 2018
ISBN 10: 3319847511 ISBN 13: 9783319847511
Language: English
Taschenbuch. Condition: Neu. Combinatorics and Complexity of Partition Functions | Alexander Barvinok | Taschenbuch | vi | Englisch | 2018 | Springer International Publishing | EAN 9783319847511 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Combinatorics and Complexity of Partition Functions
Published by Springer International Publishing, Springer International Publishing Jul 2018, 2018
ISBN 10: 3319847511 ISBN 13: 9783319847511
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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.
-
Combinatorics and Complexity of Partition Functions
Published by Springer International Publishing, Springer International Publishing, 2018
ISBN 10: 3319847511 ISBN 13: 9783319847511
Language: English
Taschenbuch. 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
Buch. 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.
-
US$ 226.59
US$ 16.52 shipping
Ships 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 (Hardcover)
Published by Springer International Publishing AG, Cham, 2017
ISBN 10: 3319518283 ISBN 13: 9783319518282
Language: English
First Edition
Hardcover. Condition: new. Hardcover. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
-
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
Buch. 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$ 149.76
US$ 16.52 shipping
Ships 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
Taschenbuch. 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, 2017
ISBN 10: 3319518283 ISBN 13: 9783319518282
Language: English
US$ 142.06
US$ 56.97 shipping
Ships from Germany to U.S.A.Quantity: Over 20 available
Add to basketGebunden. Condition: 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, 2018
ISBN 10: 3319847511 ISBN 13: 9783319847511
Language: English
US$ 142.06
US$ 56.97 shipping
Ships 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$ 209.97
US$ 8.59 shipping
Ships from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: New. Print on Demand.
