Factorization of polynomials

Authors:
Arjen K. Lenstra
Affiliations:
Centrum voor wiskunde en informatica, SJ Amsterdam, The Netherlands
Venue:
ACM SIGSAM Bulletin
Year:
1984

Citing 10
Cited 0

Factoring Multivariate Integral Polynomials

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Factorization of Univariate Integer Polynomials by Diophantine Aproximation and an Improved Basis Reduction Algorithm

Proceedings of the 11th Colloquium on Automata, Languages and Programming
Lattices and Factorization of Polynomials over Algebraic Number Fields

EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra
Factoring polynominals over algebraic number fields

EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
A generalized class of polynomials that are hard to factor

SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Solvability by radicals is in polynomial time

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Improved algorithms for integer programming and related lattice problems

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On breaking generalized knapsack public key cryptosystems

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On the complexity of factoring polynomials with integer coefficients

On the complexity of factoring polynomials with integer coefficients

Quantified Score

Hi-index	0.00

Visualization

Abstract

The last few years there have been a lot of exciting new results in the area of factorization of polynomials. In this note we give an overview of the most important results, and we give some directions for future research.