A Method to Compute Minimal Polynomials

DOI10.1137/0606029zbMath0599.68039OpenAlexW2040108847MaRDI QIDQ3735078

Barbara R. Peskin, David R. Richman

Publication date: 1985

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0606029

zbMATH Keywords

algorithmfinite fieldirreducible polynomial

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05)

Related Items

On the computation of minimal polynomials ⋮ The algebraic degree of geometric optimization problems ⋮ A new proof of the Abhyankar–Moh–Suzuki theorem via a new algorithm for the polynomial dependence ⋮ On the Newton polyhedron of a Jacobian pair

Cites Work

• On the computation of minimal polynomials
• On the Asymptotic Complexity of Matrix Multiplication
• Generation of Irreducible Polynomials Over a Finite Field
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Method to Compute Minimal Polynomials