On Counting Lattice Points in Polyhedra

DOI10.1137/0220044zbMath0733.52005MaRDI 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

polytopes; lattice points; polynomial time; computational problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

52C07: Lattices and convex bodies in (n) dimensions (aspects of discrete geometry)

52B55: Computational aspects related to convexity

Related Items

On integer points in polyhedra