Enumerating a subset of the integer points inside a Minkowski sum
From MaRDI portal
Recommendations
- Enumerating integer points in polytopes with bounded subdeterminants
- Minkowski sums of point sets defined by inequalities
- Integer points enumerator of hypergraphic polytopes
- Enumeration of integer points in projections of unbounded polyhedra
- On the integer points in a lattice polytope: \(n\)-fold Minkowski sum and boundary
- Counting integer points in higher-dimensional polytopes
- Enumerating projections of integer points in unbounded polyhedra
- Lattice points in Minkowski sums
- Counting Points of Semi-Algebraic Subsets
- scientific article; zbMATH DE number 1532360
Cites work
- scientific article; zbMATH DE number 49991 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 665697 (Why is no real title available?)
- scientific article; zbMATH DE number 1064419 (Why is no real title available?)
- scientific article; zbMATH DE number 1405493 (Why is no real title available?)
- scientific article; zbMATH DE number 236854 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- A convex geometric approach to counting the roots of a polynomial system
- A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
- A subdivision-based algorithm for the sparse resultant
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- An upper estimate for the lattice point enumerator
- Bernstein's theorem in affine space
- Computing integer points in Minkowski sums
- Decomposition of polytopes and polynomials
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Geometric algorithms and combinatorial optimization.
- How good are convex hull algorithms?
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Linear Optimization Queries
- Linear programming queries revisited
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- On the complexity of sparse elimination
- Random sampling in geometric optimization
- Slicing Minkowski sums for satellite antenna layout.
- Straight-line programs in geometric elimination theory
- Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux.
- The complexity of the word problems for commutative semigroups and polynomial ideals
- The number of integral points in integral polyhedra
- The number of roots of a system of equations
- Volume of Mixed Bodies
Cited in
(2)
This page was built for publication: Enumerating a subset of the integer points inside a Minkowski sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1602946)
