Pages that link to "Item:Q4695386"

The following pages link to Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases (Q4695386):

Displaying 50 items.

• The maximum number of faces of the Minkowski sum of two convex polytopes (Q309640) (← links)
• Maximal f-vectors of Minkowski sums of large numbers of polytopes (Q411394) (← links)
• Efficient edge-skeleton computation for polytopes defined by oracles (Q491253) (← links)
• Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums (Q507686) (← links)
• Distributed predictive control with minimization of mutual disturbances (Q510082) (← links)
• On feasible sets for MPC and their approximations (Q629062) (← links)
• Primitive zonotopes (Q724942) (← links)
• A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes (Q728499) (← links)
• Covering Minkowski sum boundary using points with applications (Q735518) (← links)
• Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm (Q744015) (← links)
• On the computation of Hilbert-Poincaré series (Q810595) (← links)
• Edge-directions of standard polyhedra with applications to network flows (Q811875) (← links)
• A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q831714) (← links)
• On the hardness of computing intersection, union and Minkowski sum of polytopes (Q958243) (← links)
• A linear equation for Minkowski sums of polytopes relatively in general position (Q966166) (← links)
• Computing reachable sets of hybrid systems using a combination of zonotopes and polytopes (Q988780) (← links)
• Convex integer maximization via Graver bases (Q1017675) (← links)
• On the exact maximum complexity of Minkowski sums of polytopes (Q1042457) (← links)
• Finding sparse systems of parameters (Q1328769) (← links)
• A convex geometric approach to counting the roots of a polynomial system (Q1338221) (← links)
• The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases. (Q1408266) (← links)
• Enumerating a subset of the integer points inside a Minkowski sum (Q1602946) (← links)
• Combinatorial duality for Poincaré series, polytopes and invariants of plumbed 3-manifolds (Q1730269) (← links)
• Complexity of Gröbner basis detection and border basis detection (Q1758159) (← links)
• Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
• Mixed-volume computation by dynamic lifting applied to polynomial system solving (Q1921341) (← links)
• A comparison of unrestricted dynamic Gröbner basis algorithms (Q2025445) (← links)
• A dynamic F4 algorithm to compute Gröbner bases (Q2025446) (← links)
• The Minkowski sum of simplices in 3-dimensional space. An analytical description (Q2248741) (← links)
• Optimality conditions for maximizing a function over a polyhedron (Q2248749) (← links)
• Stabilising model predictive control for discrete-time fractional-order systems (Q2374459) (← links)
• Algorithmic operator algebras via normal forms in tensor rings (Q2409019) (← links)
• Convex integer optimization by constantly many linear counterparts (Q2451653) (← links)
• The minimal disturbance invariant set: outer approximations via its partial sums (Q2466060) (← links)
• The use of edge-directions and linear programming to enumerate vertices (Q2471066) (← links)
• Universal characteristic decomposition of radical differential ideals (Q2481473) (← links)
• Robust predictive regulation with invariance constraint (Q2512193) (← links)
• From the zonotope construction to the Minkowski addition of convex polytopes (Q2643562) (← links)
• A Note on Dynamic Gröbner Bases Computation (Q2830005) (← links)
• Computation of Stackelberg Equilibria of Finite Sequential Games (Q3460789) (← links)
• Cephoids: Minkowski sums of de Gua simplexes (Q3577845) (← links)
• Coxeter‐associahedra (Q4323662) (← links)
• On the Length of Monotone Paths in Polyhedra (Q5009332) (← links)
• Hyperplane Arrangements in polymake (Q5041056) (← links)
• Sharp Bounds for the Number of Regions of Maxout Networks and Vertices of Minkowski Sums (Q5886829) (← links)
• Optimization via low-rank approximation for community detection in networks (Q5963526) (← links)
• Monotone diameter of bisubmodular polyhedra (Q6063788) (← links)
• The Polyhedral Geometry of Pivot Rules and Monotone Paths (Q6075416) (← links)
• Shadows of Newton polytopes (Q6076195) (← links)
• A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q6126717) (← links)