Name
Abstract | ||
|---|---|---|
In this paper, we address the problem of deciding ab- solute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. (1, 2, 3) where they have considered the prob- lem for bivariate polynomials by studying the integral decomposability of polygons in the sense of Minkowski sum. We have generalized their result to polynomials containing arbitrary number of variables by reducing the problem of Minkowski decomposability of an in- teger (lattice) polytope to an integer linear program. We also present experimental results of computation of Minkowski decomposition using this integer program. |
Year | Venue | Keywords |
|---|---|---|
2008 | CCCG | minkowski sum |
DocType | Citations | PageRank |
Conference | 2 | 0.40 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Deepanjan Kesh | 1 | 74 | 6.53 |
| Shashank Mehta | 2 | 2 | 0.40 |