SHARPER COMPLEXITY BOUNDS FOR ZERO-DIMENSIONAL GRÖBNER BASES AND POLYNOMIAL SYSTEM SOLVING
2011 ◽
Vol 21
(05)
◽
pp. 703-713
◽
Keyword(s):
The main purpose of this paper is to improve the bound of complexity of the well-known algorithms on polynomial ideals having complexities polynomial in dn, where d is the maximal degree of input polynomials and n is the number of variables. Instead of this bound, we present the more accurate bound max {S, Dn} where S is the size of the input polynomials in dense representation, and D is the arithmetic mean value of the degrees of input polynomials.
2013 ◽
Vol 49
◽
pp. 78-94
◽
1992 ◽
Vol 20
(8)
◽
pp. 2271-2287
◽
1998 ◽
Vol 26
(3)
◽
pp. 381-386
◽
1991 ◽
Vol 33
(1-3)
◽
pp. 191-203
◽
Keyword(s):
2010 ◽
Vol 36
(2)
◽
pp. 75-82
◽
1988 ◽
Vol 6
(2-3)
◽
pp. 149-167
◽