2,421 research outputs found
Faster polynomial multiplication over finite fields
Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two
polynomials in F_p[X] of degree less than n. For n large compared to p, we
establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the
iterated logarithm. This is the first known F\"urer-type complexity bound for
F_p[X], and improves on the previously best known bound M_p(n) = O(n log n log
log n log p)
Computing Puiseux series : a fast divide and conquer algorithm
Let be a polynomial of total degree defined over
a perfect field of characteristic zero or greater than .
Assuming separable with respect to , we provide an algorithm that
computes the singular parts of all Puiseux series of above in less
than operations in , where
is the valuation of the resultant of and its partial derivative with
respect to . To this aim, we use a divide and conquer strategy and replace
univariate factorization by dynamic evaluation. As a first main corollary, we
compute the irreducible factors of in up to an
arbitrary precision with arithmetic
operations. As a second main corollary, we compute the genus of the plane curve
defined by with arithmetic operations and, if
, with bit operations
using a probabilistic algorithm, where is the logarithmic heigth of .Comment: 27 pages, 2 figure
- …