Minimizing the number of lattice points in a translated polygon

DOI10.1137/1.9781611973105.80zbMath1423.11173arXiv1207.0979OpenAlexW2952875504MaRDI QIDQ5741788

Nicolai Hähnle, Friedrich Eisenbrand

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.0979

zbMATH Keywords

Barvinok's algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects related to convexity (52B55) Lattice points in specified regions (11P21)

Related Items (2)

The Computational Complexity of Integer Programming with Alternations ⋮ On the number of integer points in translated and expanded polyhedra

This page was built for publication: Minimizing the number of lattice points in a translated polygon