Pages that link to "Item:Q1399670"

The following pages link to Irreducibility of polynomials modulo \(p\) via Newton polytopes. (Q1399670):

Displaying 11 items.

• Families of polynomials and their specializations (Q311487) (← links)
• On pseudopoints of algebraic curves (Q616142) (← links)
• Indecomposability of polynomials via Jacobian matrix (Q984987) (← links)
• Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem (Q990817) (← links)
• Bivariate factorization using a critical fiber (Q1683738) (← links)
• Zero-patterns of polynomials and Newton polytopes. (Q1873810) (← links)
• Arithmetic constraints of polynomial maps through discrete logarithms (Q1981610) (← links)
• Lifting and recombination techniques for absolute factorization (Q2371310) (← links)
• Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations (Q2894535) (← links)
• Control of the non-geometrically integral reductions (Q5025437) (← links)
• On Functional Graphs of Quadratic Polynomials (Q5228846) (← links)