AbstractThis paper describes an algebraic approach to computing the system of adjoint curves to a given absolutely irreducible plane algebraic curve. The proposed algorithm utilizes the integral closure of the coordinate ring rather than expanding neighborhood graphs using quadratic transformations
We design algorithms for finding roots of polynomials over function fields of curves. Such algorithm...
AbstractWe present an algorithm that can be used to check whether a given derivation of the complex ...
AbstractUnder the assumption that we have defining equations of an affine algebraic curve in special...
AbstractThis paper describes an algebraic approach to computing the system of adjoint curves to a gi...
AbstractWe present algorithms for parametrizing by radicals an irreducible curve, not necessarily pl...
International audienceThe word "adjoint" refers to several definitions which are not all equivalent:...
An algorithm is presented for the geometric analysis of an algebraic curve $f(x,y)=0$ in the real af...
We present a variety of computational techniques dealing with algebraic curves both in the plane and...
The common zero locus of a set of multivariate polynomials (with complex coefficients) determines an...
We present algorithms to compute the genus and rational parametric equations, for implicitly defined...
Let C be a projective algebraic curve. Suppose that C has ordinary singularities (with reduced tang...
Available from Centro de Informacion y Documentacion Cientifica CINDOC. Joaquin Costa, 22. 28002 Mad...
AbstractIn this paper, we propose a fast semi-numerical algorithm for computing all irreducible bran...
AbstractWe provide a solution to the important problem of constructing complete independent sets of ...
Abstract. We present an algorithm that can be used to check whether a given derivation of the comple...
We design algorithms for finding roots of polynomials over function fields of curves. Such algorithm...
AbstractWe present an algorithm that can be used to check whether a given derivation of the complex ...
AbstractUnder the assumption that we have defining equations of an affine algebraic curve in special...
AbstractThis paper describes an algebraic approach to computing the system of adjoint curves to a gi...
AbstractWe present algorithms for parametrizing by radicals an irreducible curve, not necessarily pl...
International audienceThe word "adjoint" refers to several definitions which are not all equivalent:...
An algorithm is presented for the geometric analysis of an algebraic curve $f(x,y)=0$ in the real af...
We present a variety of computational techniques dealing with algebraic curves both in the plane and...
The common zero locus of a set of multivariate polynomials (with complex coefficients) determines an...
We present algorithms to compute the genus and rational parametric equations, for implicitly defined...
Let C be a projective algebraic curve. Suppose that C has ordinary singularities (with reduced tang...
Available from Centro de Informacion y Documentacion Cientifica CINDOC. Joaquin Costa, 22. 28002 Mad...
AbstractIn this paper, we propose a fast semi-numerical algorithm for computing all irreducible bran...
AbstractWe provide a solution to the important problem of constructing complete independent sets of ...
Abstract. We present an algorithm that can be used to check whether a given derivation of the comple...
We design algorithms for finding roots of polynomials over function fields of curves. Such algorithm...
AbstractWe present an algorithm that can be used to check whether a given derivation of the complex ...
AbstractUnder the assumption that we have defining equations of an affine algebraic curve in special...
DOI
Add to ORKG