On the number of integer points in translated and expanded polyhedra
From MaRDI portal
Publication:2227240
DOI10.1007/s00454-020-00178-zOpenAlexW3005326639MaRDI QIDQ2227240
Publication date: 10 February 2021
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.03685
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds on generalized Frobenius numbers
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
- Integer points in polyhedra
- Lattice translates of a polytope and the Frobenius problem
- NP-complete decision problems for binary quadratics
- Periods of Ehrhart coefficients of rational polytopes
- Complexity of the Frobenius problem
- Integer points in knapsack polytopes and \(s\)-covering radius
- Maximal periods of (Ehrhart) quasi-polynomials
- Counting with rational generating functions
- Faster algorithms for Frobenius numbers
- Computing the period of an Ehrhart quasi-polynomial
- Unimodality problems in Ehrhart theory
- Parametric polyhedra with at least k lattice points: Their semigroup structure and the k-Frobenius problem
- Integer Programming with a Fixed Number of Variables
- COMPLEXITY OF SHORT GENERATING FUNCTIONS
- Parametric Integer Programming in Fixed Dimension
- Short rational generating functions for lattice point problems
- The computational complexity of integer programming with alternations
- Computational Complexity
- Integer Polynomial Optimization in Fixed Dimension
- Computing the Ehrhart quasi-polynomial of a rational simplex
- Minimizing the number of lattice points in a translated polygon
