On the deterministic complexity of factoring polynomials over finite fields
- 10 January 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 33 (5), 261-267
- https://doi.org/10.1016/0020-0190(90)90195-4
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Factoring polynomials and primitive elements for special primesTheoretical Computer Science, 1987
- Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomialsIEEE Transactions on Information Theory, 1983
- 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
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- Schnelle Multiplikation von Polynomen ber K rpern der Charakteristik 2Acta Informatica, 1977
- Analysis of a simple factorization algorithmTheoretical Computer Science, 1976
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970