A bound for the degree of a system of equations determining the variety of reducible polynomials
From MaRDI portal
Publication:2849092
Recommendations
Cites work
Cited in
(10)- Irreducibility of Hypersurfaces
- An estimate for the number of reducible Bessel polynomials of bounded degree
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I
- Translates of Polynomials
- Efficient absolute factorization of polynomials with parametric coefficients
- Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II
- Reducing the number of equations defining a subset of the \(n\)-space over a finite field
- A deterministic polynomial-time algorithm for the first Bertini theorem. III
- Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III
- A deterministic polynomial-time algorithm for the first Bertini theorem. II
This page was built for publication: A bound for the degree of a system of equations determining the variety of reducible polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849092)