Pages that link to "Item:Q1892221"
From MaRDI portal
The following pages link to Effective Noether irreducibility forms and applications (Q1892221):
Displayed 28 items.
- Families of polynomials and their specializations (Q311487) (← links)
- Nonsingular points on hypersurfaces over \(\mathbb F_q\) (Q393226) (← links)
- Modular Las Vegas algorithms for polynomial absolute factorization (Q607052) (← links)
- On the total order of reducibility of a pencil of algebraic plane curves (Q661865) (← links)
- Factoring bivariate sparse (lacunary) polynomials (Q883330) (← links)
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting (Q964741) (← links)
- Indecomposability of polynomials via Jacobian matrix (Q984987) (← links)
- Specified precision polynomial root isolation is in NC (Q1329153) (← links)
- Irreducibility of polynomials modulo \(p\) via Newton polytopes. (Q1399670) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- Probabilistic absolute irreducibility test for polynomials (Q1612137) (← links)
- Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
- Linear differential operators for polynomial equations (Q1864893) (← links)
- Factorization of polynomials given by arithmetic branching programs (Q2051373) (← links)
- Uniform bounds for the number of rational points on varieties over global fields (Q2104871) (← links)
- Equivalence of polynomial identity testing and polynomial factorization (Q2351391) (← links)
- Lifting and recombination techniques for absolute factorization (Q2371310) (← links)
- An application of random plane slicing to counting \(\mathbb{F}_q\)-points on hypersurfaces (Q2406674) (← links)
- Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
- Improved explicit estimates on the number of solutions of equations over a finite field (Q2490135) (← links)
- Semi-numerical absolute factorization of polynomials with integer coefficients (Q2643526) (← links)
- Fast computation of a rational point of a variety over a finite field (Q3420246) (← links)
- Factoring multivariate polynomials via partial differential equations (Q4794644) (← links)
- Control of the non-geometrically integral reductions (Q5025437) (← links)
- Typical ranks of<i>m</i>×<i>n</i>× (<i>m</i>− 1)<i>n</i>tensors with 3 ≤<i>m</i>≤<i>n</i>over the real number field (Q5175371) (← links)
- SMOOTHNESS IN PENCILS OF HYPERSURFACES OVER FINITE FIELDS (Q5879215) (← links)
- Absolute irreducibility of polynomials via Newton polytopes (Q5936184) (← links)
- Points of bounded height on curves and the dimension growth conjecture over Fq[t]$\mathbb {F}_q[t]$ (Q6133271) (← links)