Given an irreducible algebraic curve f(x,y)=0 of degree n≥3 with rational coefficients,we describe algorithms for determinig whether the curve is singular, and if so, isolating its singular points, computing their multiplicities, and counting the number of distinct tangents at each. The algorithms require only rational arithmetic operations on the coefficients of f(x,y)=0, and avoid the need for more abstract symbolic representations of the singular point coordinates
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
Given an irreducible algebraic curve f(x,y)=0 of degree n≥3 with rational coefficients,we describe a...
AbstractWe compute the singular points of a plane rational curve, parametrically given, using the im...
We compute the singular points of a plane rational curve, parametrically given, using the implicitiz...
AbstractWe compute the singular points of a plane rational curve, parametrically given, using the im...
We consider the problem of computing a representation of the plane graph induced by one (or more) a...
We present an algorithm that computes the singular points of projective plane algebraic curves and d...
There are 42 types of real singular points for irreducible real quintic curves and 49 types of real ...
We consider the problem of computing a representation of the plane graph induced by one (or more) al...
We consider the problem of computing a representation of the plane graph induced by one (or more) al...
We prove upper bounds for the number of rational points on non-singular cubic curves defined over th...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
The common zero locus of a set of multivariate polynomials (with complex coefficients) determines an...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
Given an irreducible algebraic curve f(x,y)=0 of degree n≥3 with rational coefficients,we describe a...
AbstractWe compute the singular points of a plane rational curve, parametrically given, using the im...
We compute the singular points of a plane rational curve, parametrically given, using the implicitiz...
AbstractWe compute the singular points of a plane rational curve, parametrically given, using the im...
We consider the problem of computing a representation of the plane graph induced by one (or more) a...
We present an algorithm that computes the singular points of projective plane algebraic curves and d...
There are 42 types of real singular points for irreducible real quintic curves and 49 types of real ...
We consider the problem of computing a representation of the plane graph induced by one (or more) al...
We consider the problem of computing a representation of the plane graph induced by one (or more) al...
We prove upper bounds for the number of rational points on non-singular cubic curves defined over th...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
The common zero locus of a set of multivariate polynomials (with complex coefficients) determines an...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an el...