Pages that link to "Item:Q2849092"
From MaRDI portal
The following pages link to A bound for the degree of a system of equations determining the variety of reducible polynomials (Q2849092):
Displaying 8 items.
- A deterministic polynomial-time algorithm for the first Bertini theorem. III (Q748510) (← links)
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I (Q1661547) (← links)
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III (Q2202706) (← links)
- A deterministic polynomial-time algorithm for the first Bertini theorem. II (Q2256657) (← links)
- Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II (Q2307966) (← links)
- Efficient absolute factorization of polynomials with parametric coefficients (Q2406893) (← links)
- An estimate for the number of reducible Bessel polynomials of bounded degree (Q4322346) (← links)
- Translates of Polynomials (Q4811372) (← links)
