On the computation of minimal polynomials, cyclic vectors, and Frobenius forms
From MaRDI portal
(Redirected from Publication:1361771)
Recommendations
Cites work
- scientific article; zbMATH DE number 424718 (Why is no real title available?)
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3121635 (Why is no real title available?)
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 4033867 (Why is no real title available?)
- scientific article; zbMATH DE number 107769 (Why is no real title available?)
- scientific article; zbMATH DE number 1263354 (Why is no real title available?)
- scientific article; zbMATH DE number 1263430 (Why is no real title available?)
- scientific article; zbMATH DE number 1263431 (Why is no real title available?)
- scientific article; zbMATH DE number 3320800 (Why is no real title available?)
- A deterministic construction of normal bases with complexity \(O(n^ 3+n\log n\log(\log n)\log q)\)
- Computing Frobenius maps and factoring polynomials
- Constructing normal bases in finite fields
- Nearly Optimal Algorithms for Canonical Matrix Forms
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Some asymptotic results on finite vector spaces
Cited in
(13)- On Gelbaum's Algorithm for Computing the Minimal Polynomial of a Matrix
- scientific article; zbMATH DE number 1834664 (Why is no real title available?)
- scientific article; zbMATH DE number 2089958 (Why is no real title available?)
- An algorithm for a result on minimal polynomials
- An application of the Gröbner basis in computation for the minimal polynomials and inverses of block circulant matrices
- Computing minimal polynomials of matrices
- Black box Frobenius decompositions over small fields
- Linear recurrent cryptography: Golden-like cryptography for higher order linear recurrences
- scientific article; zbMATH DE number 558500 (Why is no real title available?)
- The RCH method for computing minimal polynomials of polynomial matrices
- scientific article; zbMATH DE number 1574494 (Why is no real title available?)
- Algorithms for finding the minimal polynomials and inverses of resultant matrices
- scientific article; zbMATH DE number 4127340 (Why is no real title available?)
This page was built for publication: On the computation of minimal polynomials, cyclic vectors, and Frobenius forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361771)