AbstractThe Bezout-Inequality, an affine version (not including multiplicities) of the classical Bezout-Theorem is derived for applications in algebraic complexity theory. Upper bounds for the cardinality and number of sets definable by first order formulas over algebraically closed fields are given. This is used for fast quantifier elimination in algebraically closed fields
The final publication is available at www.springerlink.comInternational audienceWe prove formally th...
AbstractWe propose a decision procedure for algebraically closed fields based on a quantifier elimin...
AbstractIn this paper we obtain an effective algorithm for quantifier elimination over algebraically...
AbstractThe Bezout-Inequality, an affine version (not including multiplicities) of the classical Bez...
AbstractThis paper deals mainly with fast quantifier elimination in the elementary theory of algebra...
In this paper we give a new algorithm for quantifier elimination in the first order theory of real c...
This thesis addresses several classic problems in algebraic and symbolic computation related to the...
A bound for Betti numbers of sets definable in o-minimal structures is presented. An axiomatic compl...
We consider linear problems in fields, ordered fields, discretely valued fields (with finite residue...
We consider the problem of deciding whether a set of multivariate polynomials with coefficients in ...
AbstractWe show that there are algorithms which find an approximate zero of a system of polynomial e...
This paper describes a very simple (high school level) algorithm of quantifier elimination for real ...
Abstract. In this paper we prove new bounds on the sum of the Betti numbers of closed semi-algebraic...
AbstractLet K be an algebraically closed field of characteristic 0. We show that constants can be re...
The final publication is available at www.springerlink.comInternational audienceWe prove formally th...
The final publication is available at www.springerlink.comInternational audienceWe prove formally th...
AbstractWe propose a decision procedure for algebraically closed fields based on a quantifier elimin...
AbstractIn this paper we obtain an effective algorithm for quantifier elimination over algebraically...
AbstractThe Bezout-Inequality, an affine version (not including multiplicities) of the classical Bez...
AbstractThis paper deals mainly with fast quantifier elimination in the elementary theory of algebra...
In this paper we give a new algorithm for quantifier elimination in the first order theory of real c...
This thesis addresses several classic problems in algebraic and symbolic computation related to the...
A bound for Betti numbers of sets definable in o-minimal structures is presented. An axiomatic compl...
We consider linear problems in fields, ordered fields, discretely valued fields (with finite residue...
We consider the problem of deciding whether a set of multivariate polynomials with coefficients in ...
AbstractWe show that there are algorithms which find an approximate zero of a system of polynomial e...
This paper describes a very simple (high school level) algorithm of quantifier elimination for real ...
Abstract. In this paper we prove new bounds on the sum of the Betti numbers of closed semi-algebraic...
AbstractLet K be an algebraically closed field of characteristic 0. We show that constants can be re...
The final publication is available at www.springerlink.comInternational audienceWe prove formally th...
The final publication is available at www.springerlink.comInternational audienceWe prove formally th...
AbstractWe propose a decision procedure for algebraically closed fields based on a quantifier elimin...
AbstractIn this paper we obtain an effective algorithm for quantifier elimination over algebraically...
DOI
Add to ORKG