On Counting Lattice Points in Polyhedra

DOI10.1137/0220044zbMath0733.52005OpenAlexW2024809129MaRDI QIDQ3359328

Martin Dyer

Publication date: 1991

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0220044

zbMATH Keywords

polytopeslattice pointspolynomial timecomputational problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Computational aspects related to convexity (52B55)

Related Items (4)

A Euclid style algorithm for MacMahon's partition analysis ⋮ On integer points in polyhedra ⋮ Polyhedral circuits and their applications ⋮ Rational polyhedral outer-approximations of the second-order cone

This page was built for publication: On Counting Lattice Points in Polyhedra