Enumerating a subset of the integer points inside a Minkowski sum
From MaRDI portal
Publication:1602946
DOI10.1016/S0925-7721(01)00049-9zbMath1016.68143WikidataQ127333762 ScholiaQ127333762MaRDI QIDQ1602946
Publication date: 24 June 2002
Published in: Computational Geometry (Search for Journal in Brave)
Related Items (2)
Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants ⋮ Rational univariate reduction via toric resultants
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bernstein's theorem in affine space
- A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- The number of roots of a system of equations
- The number of integral points in integral polyhedra
- Geometric algorithms and combinatorial optimization.
- A convex geometric approach to counting the roots of a polynomial system
- How good are convex hull algorithms?
- Straight-line programs in geometric elimination theory
- Slicing Minkowski sums for satellite antenna layout.
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- On the complexity of sparse elimination
- Volume of Mixed Bodies
- An upper estimate for the lattice point enumerator
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- Linear Optimization Queries
- Computing integer points in Minkowski sums
- Random sampling in geometric optimization
- Linear programming queries revisited
- A subdivision-based algorithm for the sparse resultant
- Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux.
- Decomposition of polytopes and polynomials
This page was built for publication: Enumerating a subset of the integer points inside a Minkowski sum