Factoring polynomials using fewer random bits
- 1 March 1990
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 9 (3) , 229-239
- https://doi.org/10.1016/s0747-7171(08)80011-9
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1984
- A new algorithm for factoring polynomials over finite fieldsMathematics of Computation, 1981
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970