This is a preview. Log in through your library . Abstract We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback