COMPUTING THE EHRHART QUASI-POLYNOMIAL OF A RATIONAL SIMPLEX Alexander Barvinok April 2005 We present a polynomial time algorithm to compute any fixed number of the highest - Ehrhart polynomial - Document - PDFSEARCH.IO

First Page	Meta Content
	COMPUTING THE EHRHART QUASI-POLYNOMIAL OF A RATIONAL SIMPLEX Alexander Barvinok April 2005 We present a polynomial time algorithm to compute any fixed number of the highest Add to Reading List Document Date: 2005-04-28 13:33:02 Open Document File Size: 248,09 KB Share Result on Facebook

COMPUTING THE EHRHART QUASI-POLYNOMIAL OF A RATIONAL SIMPLEX Alexander Barvinok April 2005 We present a polynomial time algorithm to compute any fixed number of the highestAdd to Reading List