Details:
Title  Nullstellens\"atze for zerodimensional Gr\"obner bases.  Author(s)  Amir Hashemi  Type  Article in Journal  Abstract  In this paper, we give first some nontrivial improvements of the wellknown bounds of effective Nullstellensätze. Using these bounds, we show that the Gröbner basis (for any monomial ordering) of a zero–dimensional ideal may be computed within a bit complexity which is essentially polynomial in Dn2 where n is the number of unknowns and D is the mean value of the degrees of input polynomials.  Keywords  Effective Nullstellensätze, Gröbner basis, Gaussian elimination, Macaulay matrix complexity  ISSN  10163328; 14208954/e 
URL 
http://link.springer.com/article/10.1007%2Fs0003700902619 
Language  English  Journal  Comput. Complexity  Volume  18  Number  1  Pages  155168  Publisher  Springer (Birkh\"auser), Basel  Year  2009  Edition  0  Translation 
No  Refereed 
No 
