Mathematics of Computation, Vol. 64, No. 211 (Jul., 1995), pp. 1171-1192 (22 pages) In this paper we develop a technique to obtain, in a systematic way, the consistency conditions for the ...
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 ...
IIIF provides researchers rich metadata and media viewing options for comparison of works across cultural heritage collections. Visit the IIIF page to learn more. Maurice L. Hartung, a mathematics ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback