Рет қаралды 248
In this talk, based on joint works with J.A. Hartigan and with M. Rudelson, I discuss some computationally efficient formulas, motivated by the maximum entropy principle from statistical physics, to approximate the volume of and count integer points in some combinatorially interesting families of higher-dimensional polyhedra.
Alexander Barvinok (University of Michigan)
===
Find this and many more scientific videos on www.carmin.tv/ - a French video platform for mathematics and their interactions with other sciences offering extra functionalities tailored to meet the needs of the research community.
===