Publication:4748221
zbMath0509.12002MaRDI QIDQ4748221
Publication date: 1982
polynomials over finite fields; complete factorization; polynomials over integers; algorithms for partial factorization; algorithms for root-finding; algorithms for square-free decomposition; Berlekamp-Hensel technique; deciding irreducibility; polynomial-time factoring algorithm; polynomials over algebraic number fields
68Q25: Analysis of algorithms and problem complexity
11C08: Polynomials in number theory
65H05: Numerical computation of solutions to single equations
11T06: Polynomials over finite fields
11R09: Polynomials (irreducibility, etc.)
12-04: Software, source code, etc. for problems pertaining to field theory
12-02: Research exposition (monographs, survey articles) pertaining to field theory
Related Items
