5 citations · 12 across the 6 of their papers we have counts for
Showing 2005Show all
3 papers · 1 filter
math.CO2005★ 1 cited
Computing the Ehrhart quasi-polynomial of a rational simplex
Alexander Barvinok
We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms wer…
math.CO2005★ 4 cited
Low rank approximations of symmetric polynomials and asymptotic counting of contingency tables
Alexander Barvinok
We represent the number of mxn non-negative integer matrices (contingency tables) with prescribed row sums and column sums as the expected value of the permanent of a non-negative…
math.OC2005
Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace
Alexander Barvinok
We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in R^n and related problems of complex integration and optimization…