Results 1 
6 of
6
A Superexponential Lower Bound for Gröbner Bases and ChurchRosser Commutative Thue Systems
, 1986
"... The complexity of the normal form algorithms which transform a given polynomial ideal basis into a Gröbner basis or a given commutative Thue system into a ChurchRosser system is presently unknown. In this paper we derive a doubleexponential lower bound (22") for the production length and card ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
The complexity of the normal form algorithms which transform a given polynomial ideal basis into a Gröbner basis or a given commutative Thue system into a ChurchRosser system is presently unknown. In this paper we derive a doubleexponential lower bound (22") for the production length and cardinality of ChurchRosser commutative Thue systems, and the degree and cardinality of Gröbner bases.
Some Complexity Results for Polynomial Ideals
, 1997
"... 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,.. ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
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 known to be exponential space complete. We discuss further complexity results for problems related to polynomial ideals, like the word and subword problems for commutative semigroups, a quantitative version of Hilbert’s Nullstellensatz in a complexity theoretic version, and problems concerning the computation of reduced polynomials and Gröbner bases.
New decision algorithms for finitely presented commutative semigroups
 COMPUT. MATH. APPL
, 1981
"... A new solution of the uniform word problem for finitely presented commutative semigroups is constructed from a completion procedure for commutativeassociative term rewriting systems. The corn: pletion procedure transforms a finite presentation into a uniformly terminating equivalence class term re ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
A new solution of the uniform word problem for finitely presented commutative semigroups is constructed from a completion procedure for commutativeassociative term rewriting systems. The corn: pletion procedure transforms a finite presentation into a uniformly terminating equivalence class term rewriting system which is ChurchRosser (terminates uniquely) and therefore decides equivalence of words in the given finitely presented commutative semigroup. Words are expressed in multiplicative exponential form, i.e. as finite vectors, so that fixed uniformly terminating Church.Rosser equivalence class term rewriting systems decide equivalence of words in constant space. Since the uniform word problem for finitely presented commutative semigroups requires exponential space on infinitely many instances, a ChurchRosser term rewriting system must be exponentially larger than its presentation for infinitely many presentations. This solution of the uniform word problem for finitely presented commutative semigroups, in addition to being conceptually simpler than previous solutions, is another small step towards the systematic application of uniformly terminating ChurchRosser term rewriting systems to the solved and open decision problems of algebra.
Intersecting Multisets and Applications to Multiset Languages
"... Abstract. We show that the family Sem = mREG = mCF of regular multiset languages is closed under applications of finite and iterated multisetunion, finite and iterated multisetintersection, and multisetsubtraction. For the class Sem( � k) of semilinear subsets of � k, or that of � k, Sem: = � k≥ ..."
Abstract
 Add to MetaCart
Abstract. We show that the family Sem = mREG = mCF of regular multiset languages is closed under applications of finite and iterated multisetunion, finite and iterated multisetintersection, and multisetsubtraction. For the class Sem( � k) of semilinear subsets of � k, or that of � k, Sem: = � k≥0 Sem( � k), this amounts to verify, that the componentwise maximum, minimum or nonnegative subtraction of pairs of elements from two semilinear sets is again semilinear, and that the iterated application can be replaced by a fixed finite application of multisetintersection, respectively multisetsubtraction. We solve the three questions about closure properties that remained open in [KuMi 01,KuMi 02], verify that the family mMON is not closed with respect to multisetintersection, and correct a small mistake in a proof in [EiSc 69,Bers 79]. 1
On Polynomial Ideals, Their Complexity, and Applications
, 1995
"... 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 th ..."
Abstract
 Add to MetaCart
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 discuss