99 search results - page 3 / 20 » Computing singular points of plane rational curves |
AISC
1998
Springer
13 years 11 months ago
1998
Springer
There are various algorithms known for deciding the parametrizability (rationality) of a plane algebraic curve, and if the curve is rational, actually computing a parametrization....
ANTS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an elliptic curve over a finite field, given a Weierstrass equation for the...
CAD
1999
Springer
13 years 6 months ago
1999
Springer
This article presents an efficient and robust algorithm that computes the intersection curve of two ruled surfaces. The surface intersection problem is reformulated as a zero-set ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In the present article, we consider algebraic geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane cu...
FOCS
2006
IEEE
14 years 26 days ago
2006
IEEE
The “analyst’s traveling salesman theorem” of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. This re...