425 search results - page 13 / 85 » Polynomial Factorization 1987-1991 |
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
105
click to vote
AAECC
2008
Springer
14 years 12 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 ...
DM
2007
14 years 11 months ago
2007
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
ADG
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. This paper describes a complete implementation of Ritt-Wu's characteristic sets method in the Maple system. The implemented algorithms include those with variants fo...
107
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which ...