A polynomial ideal membership problem is a (w+1)-tuple P = (f; g 1 ; g 2 ; : : : ; g w ) where f and the g i are multivariate polynomials over some ring, and the problem is to determine whether f is in the ideal generated by the g i . For polynomials over the integers or rationals, it is known that this problem is exponential space complete. We discus
An upper bound of d2x with x = n(log 3)/(log 4) is given for the generators of the module of the rel...
Abstract. Given a monomial ideal I = 〈m1, m2, · · · , mk 〉 where mi are monomials and a polynomia...
In this paper, I present a new decision procedure for the ideal membership problem for polyno-mial r...
AbstractIn this paper, we survey some of our new results on the complexity of a number of problems r...
AbstractDeciding membership for polynomial ideals represents a classical problem of computational co...
The problem of bounding the “complexity " of a polynomial ideal in terms of the degrees of its ...
AbstractThe complexity of the polynomial ideal membership problem over arbitrary fields within the f...
We give a self-contained exposition of Mayr & Meyer's example of a polynomial ideal exhibiting doubl...
We discuss the possibility of representing elements in polynomial ideals in ℂN with optimal degree b...
We discuss the possibility of representing elements in polynomial ideals in ℂN with optimal degree b...
181 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001.The approach to the ideal mem...
181 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001.The approach to the ideal mem...
We give a self-contained exposition of Mayr & Meyer's example of a polynomial ideal exhibiting doubl...
AbstractThe author defines canonical bases for ideals in polynomial rings over Z and develops an alg...
AbstractFor several computational procedures such as finding radicals and Noether normalizations, it...
An upper bound of d2x with x = n(log 3)/(log 4) is given for the generators of the module of the rel...
Abstract. Given a monomial ideal I = 〈m1, m2, · · · , mk 〉 where mi are monomials and a polynomia...
In this paper, I present a new decision procedure for the ideal membership problem for polyno-mial r...
AbstractIn this paper, we survey some of our new results on the complexity of a number of problems r...
AbstractDeciding membership for polynomial ideals represents a classical problem of computational co...
The problem of bounding the “complexity " of a polynomial ideal in terms of the degrees of its ...
AbstractThe complexity of the polynomial ideal membership problem over arbitrary fields within the f...
We give a self-contained exposition of Mayr & Meyer's example of a polynomial ideal exhibiting doubl...
We discuss the possibility of representing elements in polynomial ideals in ℂN with optimal degree b...
We discuss the possibility of representing elements in polynomial ideals in ℂN with optimal degree b...
181 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001.The approach to the ideal mem...
181 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001.The approach to the ideal mem...
We give a self-contained exposition of Mayr & Meyer's example of a polynomial ideal exhibiting doubl...
AbstractThe author defines canonical bases for ideals in polynomial rings over Z and develops an alg...
AbstractFor several computational procedures such as finding radicals and Noether normalizations, it...
An upper bound of d2x with x = n(log 3)/(log 4) is given for the generators of the module of the rel...
Abstract. Given a monomial ideal I = 〈m1, m2, · · · , mk 〉 where mi are monomials and a polynomia...
In this paper, I present a new decision procedure for the ideal membership problem for polyno-mial r...
DOI
Add to ORKG