, Volume 12, Issue 1, pp 27-37

On integer points in polyhedra

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We give an upper bound on the number of vertices ofP I , the integer hull of a polyhedronP, in terms of the dimensionn of the space, the numberm of inequalities required to describeP, and the size ϕ of these inequalities. For fixedn the bound isO(m n ϕ n− ). We also describe an algorithm which determines the number of integer points in a polyhedron to within a multiplicative factor of 1+ε in time polynomial inm, ϕ and 1/ε when the dimensionn is fixed.

Supported by Sonderfschungsbereich 303 (DFG) and NSF grant ECS-8611841.
Partially supported by NSF grant DMS-8905645.
Supported by NSF grants ECS-8418392 and CCR-8805199.
mcd%vax.oxford.ac.uk