Results 1 
7 of
7
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 19 (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.
Kronecker's Smart, Little Black Boxes
"... This paper is devoted to the complexity analysis of certain uniformity properties owned by all known symbolic methods of parametric polynomial equation solving (geometric elimination). It is shown that any parametric elimination procedure which is parsimonious with respect to branchings and division ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
This paper is devoted to the complexity analysis of certain uniformity properties owned by all known symbolic methods of parametric polynomial equation solving (geometric elimination). It is shown that any parametric elimination procedure which is parsimonious with respect to branchings and divisions must necessarily have a nonpolynomial sequential time complexity, even if highly ecient data structures (as e.g. the arithmetic circuit encoding of polynomials) are used.
A sharp bound for the CastelnuovoMumford regularity of subspace arrangements
"... Over the past twenty years rapid advances in computational algebraic geometry have generated increasing amounts of interest in quantifying the “complexity ” of ideals and modules. For a finitely generated module M over a polynomial ring S = k[x0,..., xn] with k an arbitrary field, we say that M is r ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
Over the past twenty years rapid advances in computational algebraic geometry have generated increasing amounts of interest in quantifying the “complexity ” of ideals and modules. For a finitely generated module M over a polynomial ring S = k[x0,..., xn] with k an arbitrary field, we say that M is rregular (in the
The Geometry in Constraint Logic Programs
 In Position Papers for the First Workshop on Principles and Practice of Constraint Programming
, 1993
"... Many applications of constraint programming languages concern geometric domains. We propose incorporating strong algorithmic techniques from the study of geometric and algebraic algorithms into the implementation of constraint programming languages. Interesting new computational problems in computat ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Many applications of constraint programming languages concern geometric domains. We propose incorporating strong algorithmic techniques from the study of geometric and algebraic algorithms into the implementation of constraint programming languages. Interesting new computational problems in computational geometry and computer algebra arises from such considerations. We look at what is known and what needs to be addressed.
Randomized Zero Testing of Radical Expressions and Elementary Geometry Theorem Proving
 In Proceedings of the Third International Workshop on Automated Deduction in Geometry (ADG 2000
, 1999
"... We develop a probabilistic test for the vanishing of radical expressions, that is, expressions involving the four rational operations (+; ; ; ) and square root extraction. This extends the wellknown Schwartz's probabilistic test for the vanishing of polynomials. The probabilistic test forms the ..."
Abstract
 Add to MetaCart
We develop a probabilistic test for the vanishing of radical expressions, that is, expressions involving the four rational operations (+; ; ; ) and square root extraction. This extends the wellknown Schwartz's probabilistic test for the vanishing of polynomials. The probabilistic test forms the basis of a new theorem prover for conjectures about ruler & compass constructions. Our implementation uses the Core Library which can perform exact comparison for radical expressions.
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.
On Arithmetical Formulas Whose Jacobians are Gröbner Bases
"... We exhibit classes of polynomials whose sets of kth partial derivatives form Gro ¨ bner bases for all k, with respect to all term orders. The classes are defined by syntactic constraints on arithmetical formulas defining the polynomials. Readonce formulas without constants have this property for al ..."
Abstract
 Add to MetaCart
We exhibit classes of polynomials whose sets of kth partial derivatives form Gro ¨ bner bases for all k, with respect to all term orders. The classes are defined by syntactic constraints on arithmetical formulas defining the polynomials. Readonce formulas without constants have this property for all k, while those with constants have a weaker “Gröbnerbounding ” property introduced here. For k = 1 the same properties hold even with arbitrary powering of subterms of the formulas. 1