Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- 1 May 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 6 (2), 246-269
- https://doi.org/10.1137/0406019
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Computation of Hilbert functionsJournal of Symbolic Computation, 1992
- Computational complexity of norm-maximizationCombinatorica, 1990
- Standard bases and geometric invariant theoryI. Initial ideals and state polytopesJournal of Symbolic Computation, 1988
- Applications of Gröbner Bases in Non-Linear Computational GeometryPublished by Springer Science and Business Media LLC ,1988
- An Elimination Algorithm for the Computation of All Zeros of a System of Multivariate Polynomial EquationsPublished by Springer Science and Business Media LLC ,1988
- A criterion for detectingm-regularityInventiones Mathematicae, 1987
- A Vector-Sum Theorem and its Application to Improving Flow Shop GuaranteesMathematics of Operations Research, 1981
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen GleichungssystemsAequationes mathematicae, 1970
- Partition of SpaceThe American Mathematical Monthly, 1943
- Theorie der Konvexen KörperPublished by Springer Science and Business Media LLC ,1934