10 search results - page 1 / 2 » Univariate polynomials: nearly optimal algorithms for factor... |
ISSAC
2001
Springer
13 years 9 months ago
2001
Springer
JSC
2002
13 years 4 months ago
2002
ECCC
2006
13 years 5 months ago
2006
We give new constructions of randomness extractors and lossless condensers that are optimal to within constant factors in both the seed length and the output length. For extractor...
AAECC
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
ICCS
2007
Springer
13 years 11 months ago
2007
Springer
The purpose of this study is to measure the impact of C level code polynomial arithmetic on the performances of AXIOM highlevel algorithms, such as polynomial factorization. More p...