Minkowski Addition of Polytopes: Computational Complexity and Applications to Groebner Bases
| Author | : DIMACS (GROUP) |
| Publisher | : |
| Total Pages | : 32 |
| Release | : 1990 |
| ISBN-10 | : OCLC:23361833 |
| ISBN-13 | : |
| Rating | : 4/5 ( Downloads) |
Book Synopsis Minkowski Addition of Polytopes: Computational Complexity and Applications to Groebner Bases by : DIMACS (GROUP)
Download or read book Minkowski Addition of Polytopes: Computational Complexity and Applications to Groebner Bases written by DIMACS (GROUP) and published by . This book was released on 1990 with total page 32 pages. Available in PDF, EPUB and Kindle. Book excerpt: Using the Minkowski addition of Newton polytopes, we show that the following problem can be solved in polynomial time for any finite set of polynomials [formula], where d is fixed: Does there exist a term order [tau] such that [Tau] is a Gröbner basis for its ideal with respect to [tau]? If not, find an optimal term order for [Tau] with respect to a natural Hilbert function criterion."
