Factorization of polynomials
- 1 May 1984
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGSAM Bulletin
- Vol. 18 (2), 16-18
- https://doi.org/10.1145/1089369.1089376
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.Keywords
This publication has 12 references indexed in Scilit:
- Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithmLecture Notes in Computer Science, 1984
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983
- On breaking generalized knapsack public key cryptosystemsPublished by Association for Computing Machinery (ACM) ,1983
- Improved algorithms for integer programming and related lattice problemsPublished by Association for Computing Machinery (ACM) ,1983
- Solvability by radicals is in polynomial timePublished by Association for Computing Machinery (ACM) ,1983
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- A polynomial bound for the orders of primitive solvable groupsJournal of Algebra, 1982
- A generalized class of polynomials that are hard to factorPublished by Association for Computing Machinery (ACM) ,1981
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970