AbstractIn the present paper we describe an algorithm for the computation of real radicals of polynomial ideals. Moreover, results concerning the computational requirements and the complexity as well as some theoretical consequences are presented
AbstractWe explore the consequences of an ideal I⊂R[x1,…,xn] having a real radical initial ideal, bo...
International audienceWe give an algorithm which represents the radical J of a finitely generated di...
For an ideal I⊆ℝ[x] given by a set of generators, a new semidefinite characterization of its real ra...
International audienceLet f= (f1, ..., fs) be a sequence of polynomials in Q[X1,...,Xn] of maximal d...
AbstractThe purpose of this paper is to give a complete effective solution to the problem of computi...
AbstractWe propose an algorithm for computing the radical of a polynomial ideal in positive characte...
AbstractWe propose a method for computing the radical of an arbitrary ideal in the polynomial ring i...
Systems of polynomial equations with approximate real coefficients arise frequently as models in app...
The purpose of this paper is to give a complete effective solution to the problem of computing radic...
International audienceIn this paper, we describe new methods to compute the radical (resp. real radi...
This paper shows an algorithm to construct the Gröbner bases of radicals of zero-dimensional ideals....
This paper deals with systems of polynomial differential equations, ordinary or with partial derivat...
In this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, ass...
AbstractWe explore the consequences of an ideal I⊂R[x1,…,xn] having a real radical initial ideal, bo...
International audienceWe give an algorithm which represents the radical J of a finitely generated di...
For an ideal I⊆ℝ[x] given by a set of generators, a new semidefinite characterization of its real ra...
International audienceLet f= (f1, ..., fs) be a sequence of polynomials in Q[X1,...,Xn] of maximal d...
AbstractThe purpose of this paper is to give a complete effective solution to the problem of computi...
AbstractWe propose an algorithm for computing the radical of a polynomial ideal in positive characte...
AbstractWe propose a method for computing the radical of an arbitrary ideal in the polynomial ring i...
Systems of polynomial equations with approximate real coefficients arise frequently as models in app...
The purpose of this paper is to give a complete effective solution to the problem of computing radic...
International audienceIn this paper, we describe new methods to compute the radical (resp. real radi...
This paper shows an algorithm to construct the Gröbner bases of radicals of zero-dimensional ideals....
This paper deals with systems of polynomial differential equations, ordinary or with partial derivat...
In this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, ass...
AbstractWe explore the consequences of an ideal I⊂R[x1,…,xn] having a real radical initial ideal, bo...
International audienceWe give an algorithm which represents the radical J of a finitely generated di...
For an ideal I⊆ℝ[x] given by a set of generators, a new semidefinite characterization of its real ra...
DOI
Add to ORKG