scientific article

zbMath0635.12012MaRDI QIDQ3773973

Heinz Lueneburg

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

primitive elementsalgebraic computingChinese remainder theoremfinite prime fieldsarithmetic of long integerscomputing the rational normal form of a matrixConstructive algebrafactoring a polynomialpolynomials with long coefficientstest for the irreducibility of a polynomial

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55) Software, source code, etc. for problems pertaining to linear algebra (15-04) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to field theory (12-01) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (6)

On the computation of minimal polynomials, cyclic vectors, and Frobenius forms ⋮ Iterated constructions of irreducible polynomials over finite fields with linearly independent roots ⋮ Recursive constructions of N-polynomials over \(\text{GF}(2^s)\) ⋮ Counting invariant subspaces and decompositions of additive polynomials ⋮ On p-adic computation of the rational form of a matrix ⋮ Computing rational forms of integer matrices

This page was built for publication: