Inbunden, Engelska, 2017
Del 30 i serien Algorithms and Combinatorics
Combinatorics and Complexity of Partition Functions
1849 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
Beskrivning
Produktinformation
- Utgivningsdatum: 2017-03-21
- Mått: 155 x 235 x 23 mm
- Vikt: 583 g
- Format: Inbunden
- Språk: Engelska
- Serie: Algorithms and Combinatorics
- Antal sidor: 303
- Upplaga: 17001
- Förlag: Springer International Publishing AG
- ISBN: 9783319518282
Utforska kategorier
Mer information
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)
Recensioner i media
“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)
Butikslager
Ej i lager i butik.
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.