Reducibility of polynomials \(f(x,y)\) modulo \(p\)
From MaRDI portal
Publication:1293123
DOI10.1006/jnth.1999.2381zbMath0931.11005arXivmath/9808021OpenAlexW1649905508MaRDI QIDQ1293123
Publication date: 22 February 2000
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9808021
Related Items
A quadratically convergent algorithm for structured low-rank approximation ⋮ Factoring multivariate polynomials via partial differential equations ⋮ Lifting and recombination techniques for absolute factorization ⋮ Families of polynomials and their specializations ⋮ On pseudopoints of algebraic curves ⋮ Irreducibility of polynomials modulo \(p\) via Newton polytopes. ⋮ Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time ⋮ A note on Gao's algorithm for polynomial factorization ⋮ Nombre De Facteurs Absolument Irréductibles D'un Polynôme ⋮ Improved dense multivariate polynomial factorization algorithms ⋮ A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\) ⋮ The numerical factorization of polynomials ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Approximate factorization of multivariate polynomials using singular value decomposition ⋮ Indecomposability of polynomials via Jacobian matrix ⋮ Sharp precision in Hensel lifting for bivariate polynomial factorization ⋮ Reducibility mod \(p\) of hypersurfaces in projective spaces -- an application of arithmetic Bézout ⋮ Control of the non-geometrically integral reductions
Cites Work
