Pages that link to "Item:Q5936184"
From MaRDI portal
The following pages link to Absolute irreducibility of polynomials via Newton polytopes (Q5936184):
Displayed 39 items.
- Galois groups of Mori trinomials and hyperelliptic curves with big monodromy (Q253178) (← links)
- Families of polynomials and their specializations (Q311487) (← links)
- Sparse bivariate polynomial factorization (Q477285) (← links)
- On the Liouville integrability of the periodic Kostant-Toda flow on matrix loops of level \(k\) (Q529636) (← links)
- Gcd of multivariate polynomials via Newton polytopes (Q545987) (← links)
- Modular Las Vegas algorithms for polynomial absolute factorization (Q607052) (← links)
- A generalization of Baker's theorem (Q623235) (← links)
- Dilation of Newton polytope and \(p\)-adic estimate (Q633201) (← links)
- On the Galois group of generalized Laguerre polynomials (Q819859) (← links)
- An empirical study of cache-oblivious polygon indecomposability testing (Q975317) (← links)
- Parallel methods for absolute irreducibility testing (Q1009361) (← links)
- Towards toric absolute factorization (Q1030251) (← links)
- Irreducibility of polynomials modulo \(p\) via Newton polytopes. (Q1399670) (← links)
- Bivariate factorization using a critical fiber (Q1683738) (← links)
- On globally diffeomorphic polynomial maps via Newton polytopes and circuit numbers (Q1745312) (← links)
- Zero-patterns of polynomials and Newton polytopes. (Q1873810) (← links)
- Irreducibility of a sum of polynomials depending on disjoint sets of variables (Q2088977) (← links)
- The dimension growth conjecture, polynomial in the degree and without logarithmic factors (Q2212121) (← links)
- A \(\tau \)-conjecture for Newton polygons (Q2340507) (← links)
- Approximating multidimensional subset sum and Minkowski decomposition of polygons (Q2364904) (← links)
- Lifting and recombination techniques for absolute factorization (Q2371310) (← links)
- Fast separable factorization and applications (Q2426955) (← links)
- Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
- An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation (Q2482628) (← links)
- Poncelet-Darboux, Kippenhahn, and Szegő: interactions between projective geometry, matrices and orthogonal polynomials (Q2669356) (← links)
- Sharp precision in Hensel lifting for bivariate polynomial factorization (Q3377003) (← links)
- Tropicalization and irreducibility of generalized Vandermonde determinants (Q3642649) (← links)
- The three-point Pick–Nevanlinna interpolation problem on the polydisc (Q4576791) (← links)
- Coercive polynomials: stability, order of growth, and Newton polytopes (Q4613988) (← links)
- An application of bivariate polynomial factorization on decoding of Reed-Solomon based codes (Q5155704) (← links)
- Coercive Polynomials and Their Newton Polytopes (Q5502243) (← links)
- Diophantine equations with three monomials (Q6046937) (← links)
- Irreducibility of Binomials (Q6047986) (← links)
- Plane curves giving rise to blocking sets over finite fields (Q6063135) (← links)
- Shadows of Newton polytopes (Q6076195) (← links)
- On two conjectures of irreducible polynomials (Q6094271) (← links)
- Simple complex tori of algebraic dimension 0 (Q6156014) (← links)
- \textsc{Rings}: an efficient Java/Scala library for polynomial rings (Q6159541) (← links)
- Computing Circuit Polynomials in the Algebraic Rigidity Matroid (Q6161559) (← links)