Polynomials, constructivity and randomness

MaRDI QIDQ4942045zbMATH OpenFDO

Authors Doru Ştefănescu

Publication date 3 August 2000

zbMATH Keywords

algorithms on polynomialsHilbert's irreducibility theorem

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Polynomials in general fields (irreducibility, etc.) (12E05)

Review text

This paper contains a general discussion of several topics related to algorithms on polynomials. Namely, characterization of irreducible polynomials, Hilbert's irreducibility theorem, factorization of polynomials. A special emphasis is given to probabilistic algorithms on polynomials. The paper ends with several bounds on the factors of polynomials. For the entire collection see [Zbl 0930.00018].

Recommendations

• scientific article; zbMATH DE number 1542868
• Irreducibility of multivariate polynomials
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• scientific article; zbMATH DE number 3997938
• Factoring polynomials using fewer random bits

Cited in

(4)

• Polymatroids: Construction and random algorithms
• scientific article; zbMATH DE number 1542868 (Why is no real title available?)
• Polynomial Space Randomness in Analysis
• Random CNF's are hard for the polynomial calculus

This page was built for publication: Polynomials, constructivity and randomness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4942045)