A bound for the degree of a system of equations determining the variety of reducible polynomials

DOI10.1090/S1061-0022-2013-01251-9zbMath1283.14026MaRDI QIDQ2849092

Alexander L. Chistov

Publication date: 16 September 2013

Published in: St. Petersburg Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

latticesBertini theoremabsolute irreducibility

Mathematics Subject Classification ID

Computational aspects of higher-dimensional varieties (14Q15) Polynomials in general fields (irreducibility, etc.) (12E05) Special varieties (14M99) Polynomials, factorization in commutative rings (13P05)

Related Items (6)

Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. I ⋮ Efficient absolute factorization of polynomials with parametric coefficients ⋮ 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 ⋮ A deterministic polynomial-time algorithm for the first Bertini theorem. III ⋮ Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II

Cites Work

• Unnamed Item
• Factoring polynomials with rational coefficients
• Vandermonde matrices, NP-completeness and transversal subspaces
• Pencils on an Algebraic Variety and a New Proof of a Theorem of Bertini

This page was built for publication: A bound for the degree of a system of equations determining the variety of reducible polynomials