The following pages link to On integer points in polyhedra (Q1193530):
Displayed 7 items.
- Shrinking of time Petri nets (Q378906) (← links)
- Computing efficiently the lattice width in any dimension (Q638564) (← links)
- On integer points in polyhedra: A lower bound (Q1196682) (← links)
- On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid (Q1345882) (← links)
- Approximation of convex sets by polytopes (Q2519248) (← links)
- Random points and lattice points in convex bodies (Q3518215) (← links)
- Efficient Lattice Width Computation in Arbitrary Dimension (Q3648771) (← links)