scientific article; zbMATH DE number 4069044

From MaRDI portal
Publication:3801690





[For the entire collection see Zbl 0642.00029.] Let K be a field, \(R=K[X_ 1,...,X_ n]\) be the polynomial ring, F be a set of m polynomials of total degree at most d in R, \(G=GB(F)\) be the unique reduced Gröbner basis for the ideal \(I=(F)\) generated by F in R. It is shown that the number \(| G|\) of polynomials in G, their maximal degree and the length of the computation of G from F are bounded recursively in n, m, d. For fixed n, m, d the size s(G) of the coefficients of the polynomials in G is linear in the corresponding coefficient size s(F) for F. Many other interesting problems in the subject are studied.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801690)