scientific article; zbMATH DE number 3968703
From MaRDI portal
Publication:3735804
Recommendations
- Factorization of polynomials over \(\mathbb{Z}/(p^n)\)
- Factorization of polynomial \(x^n - 1\) over finite fields
- Approximate factorization of polynomials in Z[x]
- Polynomial factorization over ${\mathbb F}_2$
- Approximate factorization of polynomials over Z
- Factoring polynomials of the form \(f(x^n) \in \mathbb{F}_q [x]\)
- Factorization of a special polynomial over a finite field
- Factorization of a class of polynomials over finite fields
- Factoring polynomials in the ring of formal power series over \(\mathbb Z\)
- Factorization of polynomials with rational exponents over a field
Cited in
(11)- Newton polygons of higher order in algebraic number theory
- Factorization in Z[x]
- On the number of irreducible factors of degree k dividing a given polynomial over GF(q)
- Fast Hensel's lifting implementation using partial fraction decomposition
- Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
- Modular Las Vegas algorithms for polynomial absolute factorization
- Factorization over a finite field \(\mathbb F_{p^n}\) of the composite polynomials \(f\left(X^{p^r}-aX\right)\) where \(f(X)\) is an irreducible polynomial in \(\mathbb F_{p^n}(X)\)
- Approximate factorization of polynomials in Z[x]
- A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
- Factorization of integer-valued polynomials with square-free denominator
- scientific article; zbMATH DE number 4008513 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3735804)