Deterministic irreducibility testing of polynomials over large finite fields
- 31 August 1987
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 4 (1) , 77-82
- https://doi.org/10.1016/s0747-7171(87)80055-x
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial FactorizationSIAM Journal on Computing, 1985
- Factoring multivariate polynomials over finite fieldsJournal of Computer and System Sciences, 1985
- Fast parallel absolute irreducibility testingJournal of Symbolic Computation, 1985
- Factorization of multivariate polynomials over finite fieldsMathematics of Computation, 1985
- A new algorithm for factoring polynomials over finite fieldsMathematics of Computation, 1981
- On the efficiency of algorithms for polynomial factoringMathematics of Computation, 1977
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970
- Effective procedures in field theoryPhilosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences, 1956
- ON THE REDUCTIBILITY OF POLYNOMIALS OVER A FINITE FIELDThe Quarterly Journal of Mathematics, 1954
- Ein algebraisches Kriterium für absolute IrreduzibilitätMathematische Annalen, 1922