DOI10.1137/0406019zbMath0798.68157OpenAlexW1985065217WikidataQ94167498 ScholiaQ94167498MaRDI QIDQ4695386
Peter Gritzmann, Bernd Sturmfels
Publication date: 31 October 1994
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0406019
Finding sparse systems of parameters,
Sharp Bounds for the Number of Regions of Maxout Networks and Vertices of Minkowski Sums,
Hyperplane Arrangements in polymake,
A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes,
A convex geometric approach to counting the roots of a polynomial system,
Stabilising model predictive control for discrete-time fractional-order systems,
The maximum number of faces of the Minkowski sum of two convex polytopes,
Computation of Stackelberg Equilibria of Finite Sequential Games,
From the zonotope construction to the Minkowski addition of convex polytopes,
Mixed-volume computation by dynamic lifting applied to polynomial system solving,
Algorithmic operator algebras via normal forms in tensor rings,
Universal Analytic Gröbner Bases and Tropical Geometry,
Monotone diameter of bisubmodular polyhedra,
The Polyhedral Geometry of Pivot Rules and Monotone Paths,
Shadows of Newton polytopes,
Maximal f-vectors of Minkowski sums of large numbers of polytopes,
Coxeter‐associahedra,
On feasible sets for MPC and their approximations,
The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases.,
Convex integer optimization by constantly many linear counterparts,
Combinatorial duality for Poincaré series, polytopes and invariants of plumbed 3-manifolds,
Efficient edge-skeleton computation for polytopes defined by oracles,
A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes,
The minimal disturbance invariant set: outer approximations via its partial sums,
Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums,
Distributed predictive control with minimization of mutual disturbances,
The use of edge-directions and linear programming to enumerate vertices,
The Minkowski sum of simplices in 3-dimensional space. An analytical description,
Optimality conditions for maximizing a function over a polyhedron,
On the hardness of computing intersection, union and Minkowski sum of polytopes,
Complexity of Gröbner basis detection and border basis detection,
Universal characteristic decomposition of radical differential ideals,
Cephoids: Minkowski sums of de Gua simplexes,
A linear equation for Minkowski sums of polytopes relatively in general position,
A comparison of unrestricted dynamic Gröbner basis algorithms,
A dynamic F4 algorithm to compute Gröbner bases,
Computing reachable sets of hybrid systems using a combination of zonotopes and polytopes,
Primitive zonotopes,
A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes,
Robust predictive regulation with invariance constraint,
Optimization via low-rank approximation for community detection in networks,
Covering Minkowski sum boundary using points with applications,
Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm,
Solving degenerate sparse polynomial systems faster,
Convex integer maximization via Graver bases,
A Note on Dynamic Gröbner Bases Computation,
On the exact maximum complexity of Minkowski sums of polytopes,
On the Length of Monotone Paths in Polyhedra,
Enumerating a subset of the integer points inside a Minkowski sum,
On the computation of Hilbert-Poincaré series,
Edge-directions of standard polyhedra with applications to network flows
