Combinatorics and Complexity of Partition Functions / Algorithms and Combinatorics Bd.30 (PDF)

Name: Combinatorics and Complexity of Partition Functions / Algorithms and Combinatorics Bd.30
Brand: Springer-Verlag GmbH
SKU: 104011526
Price: 37.44 EUR
Availability: OnlineOnly

(Sprache: Englisch)

Autor: Alexander Barvinok

Schreiben Sie einen Kommentar zu "Combinatorics and Complexity of Partition Functions / Algorithms and Combinatorics Bd.30".

Combinatorics and Complexity of Partition Functions / Algorithms and Combinatorics Bd.30, Alexander Barvinok

Merken

Mehr zum Inhalt Presse-Zitate Autorenporträt Video

eBook (pdf) 37.44 €

Buch (Gebunden) 139.09 €

sofort als Download lieferbar

Bestellnummer: 104011526

Bisher 90.94 €
Aktionspreis bis 30.06.2024*

eBook (pdf) -59% 37.44 €

Download bestellen

Verschenken

*befristete Preissenkung des Verlages

18 DeutschlandCard Punkte sammeln

Lastschrift, Kreditkarte, Paypal, Rechnung
Kostenloser tolino webreader

Produktdetails

Produktbeschreibung
Autorenporträt
eBook Hilfe
Biblio. Angaben / Produktdetails
Pressezitat

Produktinformationen zu „Combinatorics and Complexity of Partition Functions / Algorithms and Combinatorics Bd.30 (PDF)“

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.

Autoren-Porträt von Alexander Barvinok

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)

eBook Hilfe

Informationen und Hilfe zu eBooks hier klicken!

Bibliographische Angaben

Autor: Alexander Barvinok
2017, 1st ed. 2016, 303 Seiten, Englisch
Verlag: Springer-Verlag GmbH
ISBN-10: 3319518291
ISBN-13: 9783319518299
Erscheinungsdatum: 13.03.2017

Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.

eBook Informationen

Dateiformat: PDF
Größe: 4.91 MB
Ohne Kopierschutz
Vorlesefunktion

Sprache:

Englisch

Pressezitat

“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)

Kommentar zu "Combinatorics and Complexity of Partition Functions / Algorithms and Combinatorics Bd.30"

Schreiben Sie einen Kommentar zu "Combinatorics and Complexity of Partition Functions / Algorithms and Combinatorics Bd.30".

Wie funktionieren Bewertungen?

0 Gebrauchte Artikel zu „Combinatorics and Complexity of Partition Functions / Algorithms and Combinatorics Bd.30“

Zustand	Preis	Porto	Zahlung	Verkäufer	Rating