User: Guest  Login
Title:

Some Complexity Results for Polynomial Ideals

Document type:
Technical Report
Author(s):
Ernst W. Mayr
Abstract:
In this paper, we survey some of our new results on the complexity of a number of problems related to polynomial ideals. We consider multivariate polynomials over some ring, like the integers or the rationals. For instance, a polynomial ideal membership problem is a (w + 1) - tuple P = (f,g1,g2, ... ,gw) where f and the gi are multivariate polynomials, and the problem is to determine whether f is in the ideal generated by the gi. For polynomials over the integers or rationals, this problem is kn...     »
Keywords:
polynomial ideals; algorithmic complexity; Groebner basis; normal form computation; space optimality
Year:
1997
Year / month:
1997-02-01 00:00:00
Pages:
19
 BibTeX