Towards an efficient implementation of a fast algorithm for multipoint polynomial evaluation and its parallel processing

Authors:
Hirokazu Murao;Tetsuro Fujise
Affiliations:
Computer Centre, The University of Tokyo, Yayoi 2-11-16, Bunkyo-ku, Tokyo 113, Japan;Mitsubishi Research Institute, Otemachi 2-3-6, Chiyoda-ku, Tokyo 1O0, Japan
Venue:
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
Year:
1997

Subquadratic-time factoring of polynomials over finite fields

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A new polynomial factorization algorithm and its implementation

Journal of Symbolic Computation
Arithmetic and factorization of polynomial over F2 (extended abstract)

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Parallel distinct degree factorization algorithm

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Hi-index	0.00