Practical factorization of univariate polynomials over finite fields

Authors:
Vilmar Trevisan;Paul Wang
Affiliations:
Department of Mathematics and Computer Science, Kent State University, Kent, Ohio;Department of Mathematics and Computer Science, Kent State University, Kent, Ohio
Venue:
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Year:
1991

Citing 7
Cited 0

Computer algebra: symbolic and algebraic computation (2nd ed.)

Computer algebra: symbolic and algebraic computation (2nd ed.)
Algorithmic algebraic number theory

Algorithmic algebraic number theory
On the deterministic complexity of factoring polynomials over finite fields

Information Processing Letters
Products of polynomials and a priori estimates for coefficients in polynomial decompositions: a sharp result

Journal of Symbolic Computation
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Deterministic Versus Probabilistic Factorization of Integral Polynomials

EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra
Problem #7

ACM SIGSAM Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract