43 search results - page 2 / 9 » mics 2008 |
SISAP
2008
IEEE
13 years 11 months ago
2008
IEEE
MICS
2007
13 years 4 months ago
2007
We describe an approach to the computation of symbolic resultants in which factors are removed during the course of the calculation, so reducing the stack size required for interme...
MICS
2007
13 years 4 months ago
2007
The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given B...
MICS
2010
13 years 3 months ago
2010
Abstract. Following Gaudry and G¨urel who extended Kedlaya’s point-counting algorithm to superelliptic curves, we introduce Harvey’s running time improvements for large enough...
MICS
2010
13 years 3 months ago
2010
In the early 1990s, Flynn gave an explicit description of the Jacobian of a genus 2 hyperelliptic curve to perform efficient arithmetic on these objects. In this paper, we give a ...