This paper reviews some of the known algorithms for factoring polynomials over finite fields and presents a new deterministic procedure for reducing the problem of factoring an arbitrary polynomial ...
Mathematics of Computation, Vol. 45, No. 171 (Jul., 1985), pp. 251-261 (11 pages) We present a probabilistic algorithm that finds the irreducible factors of a bivariate polynomial with coefficients ...
Forbes contributors publish independent expert analyses and insights. I write about the future of learning, work and human development. Okay, we cut a bad deal 20 years ago and it’s time to fix it.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback