Factoring polynomials and primitive elements for special primes
- 31 December 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 52 (1-2), 77-89
- https://doi.org/10.1016/0304-3975(87)90081-8
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Factorization of multivariate polynomials over finite fieldsMathematics of Computation, 1985
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- Parallel Algorithms for Algebraic ProblemsSIAM Journal on Computing, 1984
- Probabilistic algorithms in finite fieldsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- A new algorithm for factoring polynomials over finite fieldsMathematics of Computation, 1981
- On polynomial factorization over finite fieldsMathematics of Computation, 1981
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970
- Factoring Polynomials Over Finite FieldsBell System Technical Journal, 1967
- ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELDThe Quarterly Journal of Mathematics, 1954
- The Least Quadratic Non ResidueAnnals of Mathematics, 1952