84 search results - page 11 / 17 » Elliptic Curves with a Given Number of Points |
COMBINATORICS
1998
13 years 8 months ago
1998
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
CAGD
2005
13 years 8 months ago
2005
We describe a method for multiresolution deformation of closed planar curves that keeps the enclosed area constant. We use a wavelet based multiresolution representation of the cu...
CGF
2006
13 years 8 months ago
2006
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...