Pages that link to "Item:Q1196682"
From MaRDI portal
The following pages link to On integer points in polyhedra: A lower bound (Q1196682):
Displaying 15 items.
- On the number of irreducible points in polyhedra (Q343724) (← links)
- On the integer points in a lattice polytope: \(n\)-fold Minkowski sum and boundary (Q717837) (← links)
- On the polyhedral complexity of the integer points in a hyperball (Q952452) (← links)
- Some theoretical challenges in digital geometry: a perspective (Q967394) (← links)
- On integer points in polyhedra (Q1193530) (← links)
- On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid (Q1345882) (← links)
- Note on the complexity of the mixed-integer hull of a polyhedron (Q1785359) (← links)
- On the number of integer points in translated and expanded polyhedra (Q2227240) (← links)
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces (Q2403743) (← links)
- Approximation of convex sets by polytopes (Q2519248) (← links)
- Polytope Volume Computation (Q3361496) (← links)
- Random points and lattice points in convex bodies (Q3518215) (← links)
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed (Q4698099) (← links)
- Enumerating Integer Points in Polytopes with Bounded Subdeterminants (Q5062109) (← links)
- The Flatness Theorem for Some Class of Polytopes and Searching an Integer Point (Q5265218) (← links)
